Yirong Yang, University of Washington
-
PDL C-401
How many combinatorially distinct n-vertex triangulations of a d-dimensional sphere are there? In this talk, we will have a crash course in simplicial complex, going through basic definitions and tools, and use them to build A LOT OF spheres (a construction due to Nevo, Santos, and Wilson) to achieve the currently known best lower bound for the case when d is odd!
Zoom Link: https://washington.zoom.us/j/92849568892