Topology of Complexes and Distributed Computing

Explore the intersection of topology and distributed computing in this one-hour lecture by Dmitry Feichtner-Kozlov. Delve into various simplicial models for distributed computing, focusing on iterated chromatic subdivisions and their correspondence to widely-used models in the field. Examine the Weak Symmetry Breaking problem as a case study to understand how distributed computing questions can be translated into combinatorial-simplicial questions for corresponding complexes. Discover how this approach generates intriguing new and open questions across multiple mathematical disciplines, bridging the gap between applied and theoretical aspects of topology in computer science.