Janne Kokkala: Computational classification of combinatorial objects

PRACTICALITIES

Lunch is served at 12:00 noon (register at tinyurl.com/TCS180319  at the latest the Saturday before, but preferably earlier). The presentation starts at 12:10 pm and ends at 1 pm. Those of us who wish reconvene after a short break for 1½-2 hours of more technical discussions.

ABSTRACT

With the increase of availability of computing power, computational methods have become more and more common in the study of combinatorial structures. Some famous early examples of computer-assisted results are the four-color theorem (Appel, Haken, 1977) and the nonexistence of finite projective planes of order 10 (Lam, Thiel, Swiercz, 1989). Nowadays many best known solutions for various combinatorial problems have been found using a computer search.

We will discuss some computational methods for existence and classification problems in combinatorics. In particular, we review some examples related to coding theory, such as Latin squares, MDS codes, and covering arrays.