Lower bounds for centrally symmetric simplicial polytopesAlgebra & Discrete Mathematics
|Speaker:||Steven Klee, Seattle University|
|Start time:||Wed, May 30 2018, 3:10PM|
Among all simplicial d-polytopes with a fixed number of vertices, which ones can be built most economically? This question is answered in the classical Lower Bound Theorem of Walkup, Barnette, and Kalai, which characterizes the set of simplicial polytopes with the minimal number of faces of each dimension. In this talk, we will explore an extension of this result to the family of centrally symmetric simplicial polytopes, which are polytopes admitting a free involution. We will conclude with some open problems. This is joint work with Eran Nevo, Isabella Novik, and Hailun Zheng.