Almost simplicial polytopes I. The lower and upper bound theorems
Eran Nevo, Guillermo Pineda-Villavicencio, Julien Ugon, David Yost

TL;DR
This paper extends classical bounds on simplicial polytopes to almost simplicial polytopes with one nonsimplex facet, providing tight bounds, characterizations, and new constructions based on a variation of the moment curve.
Contribution
It generalizes the Lower and Upper Bound Theorems to almost simplicial polytopes, introducing new constructions and characterizations for these polytopes.
Findings
Established tight lower bounds for almost simplicial polytopes.
Established tight upper bounds and characterized maximizers.
Introduced a new construction of maximizers based on a variation of the moment curve.
Abstract
We study -vertex -dimensional polytopes with at most one nonsimplex facet with, say, vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of and , thus generalizing the classical Lower Bound Theorem by Barnette and Upper Bound Theorem by McMullen, which treat the case of . We characterize the minimizers and provide examples of maximizers, for any . Our construction of maximizers is a generalization of cyclic polytopes, based on a suitable variation of the moment curve, and is of independent interest.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Point processes and geometric inequalities · Advanced Combinatorial Mathematics
