Petar Pavešić (9/1/21): Category weight estimates of minimal triangulations

When one applies computational methods to study a specific manifold or a polyhedron it is often convenient to have as small triangulation of it as possible. However there are certain limitations on the size of a triangulation, depending on the complexity of the space under scrutiny. The determination of the minimal number of simplices that are required to triangulate a given space is a classical and much studied problem of combinatorial geometry. We will show how LS-category methods can be used to obtain lower bounds for the number of vertices in a triangulation of a given space. (This is joint work with Dejan Govc and Waclaw Marzantowicz.)