Since Curto et al introduced convex codes in 2013, the problem of classifying such codes has been a rich and complicated field of study. Numerous partial results exist, and the problem has been attacked from algebraic, combinatorial, and geometric directions, but a complete classification seems impossible to even conjecture. I will speak about a framework through which to view this problem, and the numerous and beautiful results that coexist within this framework. I will provide a tour of the current state of the art, including new Helly-type theorems, a new class of simplicial complexes, and several interesting geometric oddities—all of which can be naturally contextualized in this framework. This talk will be accessible to undergraduates.
Before the talk, at 3:10pm, there will be tea and cookies in Wean 6220.
The ACO Seminar (2018–2019)