Posted September 6, 2021
Last modified September 14, 2021
Michael Farber, Queen Mary University of London
Ample simplicial complexes
I will first describe a remarkable simplicial complex X which can be uniquely characterised by its universality and homogeneity. It contains an isomorphic copy of any simplicial complex with countably many vertexes as an induced subcomplex. A random simplicial complex on countably many vertexes is isomorphic to X with probability 1. The main focus of the talk will be on r-ample simplicial complexes which are finite approximations to X and possess many striking properties. The r-ample complexes can potentially be used for designing stable and resilient networks. The talk is based on joint work with C. Even-Zohar, L. Mead and L. Strauss.
Posted September 8, 20211:30 pm - 3:00 pm Lockett 233
Nilangshu Bhattacharyya, Louisiana State University