Every equivelar abstract polytope of type {p1, …, pn − 1} has at least 2p1⋯pn − 1 flags. In this paper, we study polytopes that attain this lower bound, called tight polytopes. Using properties of flat polytopes, we are able to give a complete local characterization of when a polytope is tight. We then show a way to construct tight polyhedra of type {p, q} when p and q are not both odd, and a way to construct regular tight polytopes of type {2k1, …, 2kn − 1}.
7 December 2011 in Journal of Algebraic Combinatorics
An abstract polytope is flat if every facet is incident on every vertex. In this paper, we prove that no chiral polytope has flat finite regular facets and finite regular vertex-figures. We then determine the three smallest non-flat regular polytopes in each rank, and use this to show that for $n \geq 8$, a chiral $n$-polytope has at least $48(n-2)(n-2)!$ flags.