DMS Combinatorics Seminar

Speaker: Joseph Briggs (Auburn University)

Title:  Colored ball sorting

Abstract: I will describe an algorithmic problem arising from a recently popularized puzzle format, and a beautiful extremal question asked by a large group of theoretical computer scientists. Graph-theoretic tools resolve one nontrivial instance, but otherwise, the problem is wide open.