Lower bound theorem for normal pseudomanifolds (Q953910): Difference between revisions

The lower bound theorem (LBT) for pseudomanifolds provides the best possible lower bound for the number of simplices of each dimension of a \(d\)-dimensional pseudomanifold in terms of the number of vertices. These bounds were established by \textit{T.S. Tay} [Discrete Comput. Geom. 13, No.2, 203--216 (1995; Zbl 0817.52016)] using a previous similar result for triangulated manifolds by \textit{G. Kalai} [Invent. Math. 88, 125--151 (1987; Zbl 0624.52004)]. Their proofs require the use of the theory of rigidity of frameworks. Tay claims that in order to obtain the LBT for pseudomanifolds it suffices to prove it for the smaller class of the so called normal pseudomanifolds. The advantage is that in this case, there is an argument (MPW reduction) which reduces the proof of the LBT to the proof of the one dimensional bound. In the article under review, a self contained combinatorial proof of the LBT for normal pseudomanifolds is exhibited. This approach makes use of a notion of rigidity introduced by M. Gromov. The authors also prove that the equality in the LBT is achieved if and only if the pseudomanifold is a particular kind of combinatorial sphere called stacked sphere. Although these results are not new, an alternative proof is given, which avoids the theory of rigidity of frameworks. In the last section of the paper, two lower bound conjectures are stated and studied for triangulated spheres and non simply connected triangulated manifolds. The methods developed to prove the main result include a combinatorial analogue to topological surgery and a deep study of the class of stacked spheres.