Bent Boolean functions are fascinating and useful combinatorial objects, whose applications include coding theory and cryptography. The number of bent functions explodes with dimension, and various concepts of equivalence are used to classify them. In 1999 Bernasconi and Codenotti noted that the Cayley graph of a bent function is strongly regular. This talk describes the concept of extended Cayley equivalence of bent functions, discusses some connections between bent functions, designs, and codes, and explores the relationship between extended Cayley equivalence and extended affine equivalence. SageMath scripts and SageMathCloud worksheets are used to compute and display some of these relationships, for bent functions up to dimension 8.

About the speaker: Paul Leopardi is a computer scientist and mathematician who works to support scientific applications at the Bureau of Meteorology in Melbourne. His academic career has included stints at UNSW, the University of Sydney, ANU and the University of Newcastle. He is an honorary Fellow at the University of Melbourne. His research interests have included high performance numerical computing, computations with Cifford algebras, constructive approximation, and bioinformatics and well as combinatorics. He was enticed to study Hadamard matrices by Judy-Anne Osborn, Jennifer Serberry and Kathy Horadam, amongst others. This led to the present study.

How to participate in this seminar:

1. Book your nearest ACE facility;

2. Notify Vera Roshchina at RMIT (rmitopt@rmit.edu.au) to notify you will be participating.

No access to an ACE facility? Contact Maaike Wienk to arrange a temporary Visimeet licence for remote access (limited number of licences available – first come first serve)