Almost simplicial polytopes I. The lower and upper bound theorems
Abstract
We study n-vertex d-dimensional polytopes with at most one nonsimplex facet with, say, d+s vertices, called almost simplicial polytopes. We provide tight lower and upper bound theorems for these polytopes as functions of d,n and s, thus generalizing the classical Lower Bound Theorem by Barnette and Upper Bound Theorem by McMullen, which treat the case of s=0. We characterize the minimizers and provide examples of maximizers, for any d. Our construction of maximizers is a generalization of cyclic polytopes, based on a suitable variation of the moment curve, and is of independent interest.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.