Latin squares in extremal and probabilistic combinatorics

Research Horizons Seminar
Wednesday, October 5, 2022 - 12:30pm for 1 hour (actually 50 minutes)
Skiles 006
Tom Kelly – Georgia Tech – tom.kelly@gatech.edu
Tong Jin

An order-n Latin square is an n by n array of n symbols such that each row and column contains each symbol exactly once.  Latin squares were famously studied by Euler in the 1700s, and at present they are still a central object of study in modern extremal and probabilistic combinatorics.  In this talk, I will give some history about Latin squares, share some simple-to-state yet notoriously difficult open problems, and present some of my own research on Latin squares.