This virtual seminar on topics that bridge combinatorics and geometry will be held on Zoom (usually) at 11:30-12:30 Eastern (Toronto) Time on the first Wednesday of every month. Complete this form to join our mailing list.
Upcoming seminars are listed below. Previous seminars are available on other tabs by year: 2024 or 2025 or 2026. Some recordings are available on the YouTube channel.
Ahmed Ashraf (University of Toronto, Mississauga)
Christin Bibby (Louisiana State University, Baton Rouge)
Colin Crowley (Western University, London ON)
Graham Denham (Western University, London ON)
For a graph G, its n-particle configuration space is the topological space defined by C_n(G) = {(x_1,…,x_n) \in G^n \mid x_i \neq x_j}. Its unordered configuration space is then defined as the quotient of C_n by the natural permutation action UC_n = C_n/S_n. One of the early great triumphs in the field was a theorem of Ko and Park, which said that H_1(UC_n(G)) contains torsion if and only if the graph G is non-planar, and that moreover this torsion was always 2-torsion. Following this result, however, researchers were unable to find torsion of any odd order in any homological index. In fact, researchers were unable to find torsion of any kind in C_n(G) and it was proven that there could not be torsion in the homologies of these spaces in a large number of natural families. All of this led to the three major folklore conjectures of the field: That torsion of odd order cannot appear in the homology of UC_n, that planar graphs could never experience torsion in the homology of UC_n, and that the spaces C_n have torsion free homology. In this talk, I will detail a project with Nick Wawrykow where we used AI tools to resolve all three of these conjectures. In particular, we prove that there exists graphs for which H_n(UC_{n+1}) contains n-torsion, we construct planar graphs for which H_2(UC_n) has torsion, and we construct graphs for which H_2(C_n) has torsion up to Z/16. All of these results lean heavily on the graph theory of the underlying graphs.
The cohomology ring of the complement of a complex hyperplane arrangement is given by its Orlik--Solomon algebra, whose presentation is given as a quotient of an exterior algebra by combinatorial relations depending only on the intersection lattice. It is known that the defining ideal of the Orlik--Solomon algebra has a quadratic Groebner basis in the standard presentation if and only if the intersection lattice is supersolvable; such algebras are automatically Koszul. In 1997, Shelton and Yuzvinsky posed the question as to whether all Koszul Orlik--Solomon algebras arise from supersolvable arrangements. We answer this question negatively using three related constructions that produce non-supersolvable arrangements whose Orlik--Solomon algebras are Koszul. Moreover, these arrangements may be chosen to be irreducible, realizable over Q, and of any rank at least 3. We therefore construct rational-K(pi,1) arrangements that are not of fiber-type. I will explain the history of the problem and the multiple constructions for such arrangements. This is joint work with Tuong Le and Chayim Lowen.