Computational Searches for Combinatorial Designs

 

UPDATE: a paper resulting from Tiana’s project has now been published in Designs, Codes and Cryptography! Check it out: ‘Difference matrices with five rows over finite abelian groups’.

Project description

My overall aim is to determine whether or not certain 4-GDDs and particular difference matrices exist. To do this, I will first develop a set of tools in Python for manipulating 4-GDDs and their so-called Michael’s edge. I will then conduct a computer search for each sought design, using Python, C and the graph isomorphism package nauty.

Tiana Tsang Ung

UNSW

Tiana Tsang Ung is a second-year student studying Mathematics and Computer Science at the University of New South Wales. Her current interests include combinatorics, proof assistants, and various topics in theoretical computer science. In the near future, she aims to learn as much about mathematics and research as possible, before going on to complete an Honours year focused on a pure maths topic. She eventually hopes to pursue a postgraduate degree in mathematics.

You may be interested in

Hanyi Wang

Hanyi Wang

Infilling Missing Data in Time Series
James McCusker

James McCusker

Quarternions And Octonions
Jack Mulqueeney

Jack Mulqueeney

Stochastic Modelling of Deterministic Time Series
Hannah Perry

Hannah Perry

Optimising the Image Mosaicing of Visual Representations of Functions
Contact Us

We're not around right now. But you can send us an email and we'll get back to you, asap.

Not readable? Change text.