Special Colloquium
Caroline Terry
Ohio State University
Measuring combinatorial complexity via regularity lemmas
Abstract: Many tools have been developed in combinatorics to study global structure in finite graphs. One such tool is called Szemerédi’s regularity lemma, which gives a structural decomposition for any large finite graph. Beginning with work of Alon-Fischer-Newman, Lovász-Szegedy, and Malliaris-Shelah, it has been shown over the last 15 years that regularity lemmas can be used to detect structural dichotomies in graphs, and that these dichotomies have deep connections to model theory. In this talk, I present extensions of this type of result to arithmetic regularity lemmas, which are analogues of graph regularity lemmas, tailored to the study of combinatorial problems in finite groups. This work uncovered tight connections between tools from additive combinatorics, and ideas from the model theoretic study of infinite groups.
Friday December 8, 2023 at 3:00 PM in 636 SEO