-
The Combinatorics of CAT(0) Cube Complexes
Abstract:
There are numerous contexts where a discrete system moves according to local, reversible moves. The configuration space, which contains all possible states of the system, is often a CAT(0) cube complex. When this is the case, we can use techniques from geometric group theory and poset theory to understand, measure, and navigate these spaces. I will present a self-contained introduction to these ideas, and discuss some applications: finding shortest paths, planning robotic motion, and sampling random lattice paths.
The talk will include joint work with many people, including Tia Baker, Naya Banerjee, Hanner Bastidas, César Ceballos, John Guo, Megan Owen, Seth Sullivant, Coleson Weir, and Rika Yatchak.
Hosted by Math Department: https://www.math.princeton.edu/events/combinatorics-cat0-cube-complexes-2024-12-02t213000