This is an extended abstract of the full version. 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 bounds for the face numbers of 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 s = 0. We characterize the minimizers and provide examples of maximizers, for any d.
History
Location
Vancouver, Canada
Start date
2016-07-04
End date
2016-07-08
ISSN
1462-7264
eISSN
1365-8050
Publication classification
E3 Extract of paper
Extent
Poster
Title of proceedings
Proceedings of the 28th Annual Conference on Formal Power Series and Algebraic Combinatorics
Event
28th International Conference on Formal Power Series and Algebraic Combinatorics (