Computational Searches for Combinatorial Designs

My overall aim is to determine whether or not certain 4-GDDs and particular difference matrices exist. To do this, I will fi rst 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

Ashley Hanson

Ashley Hanson

The Price of Anarchy, the Price of Stability, and the Price of Communication in Interacting Intensive Care Units
Monica Seeber

Monica Seeber

Accuracy and Limits of Nodal Surface Approximations of the Lonsdaleit Minimal Surface
Matthew Hanna

Matthew Hanna

Optimisation and Theoretical Implications of Probability Inequalities
Rory Jacques

Rory Jacques

Lie Symmetries of Stochastic Differential Equations
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.