Category Weight Estimates of Minimal Triangulations

Explore category weight estimates for minimal triangulations in this 50-minute lecture by Petar Pavešić. Delve into the challenges of determining the smallest possible triangulation for manifolds and polyhedra in computational studies. Learn how LS-category methods can provide lower bounds for vertex counts in space triangulations. Examine the classical problem of finding the minimal number of simplices required for triangulating a given space. Discover the joint research findings with Dejan Govc and Waclaw Marzantowicz on this topic in combinatorial geometry. Cover key concepts including explicit triangulation, minimal triangulations, good colors, and CT of X. Engage with questions and remarks to deepen understanding of this complex subject in applied algebraic topology.

Introduction
Explicit triangulation
Minimal triangulations
Point of view
Good colors
CT of X
The problem
Questions
Question
Remarks