Almost simplicial polytopes: The lower and upper bound theorems (Extended Abstract)
Pineda Villavicencio, Guillermo, Nevo, E, Ugon, Julien and Yost, D 2016, Almost simplicial polytopes: The lower and upper bound theorems (Extended Abstract), in Proceedings of the 28th Annual Conference on Formal Power Series and Algebraic Combinatorics, DMTCS Proceedings,.
Attached Files
Name
Description
MIMEType
Size
Downloads
Title
Almost simplicial polytopes: The lower and upper bound theorems (Extended Abstract)
Proceedings of the 28th Annual Conference on Formal Power Series and Algebraic Combinatorics
Publication date
2016
Total pages
12
Publisher
DMTCS Proceedings
Summary
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.
Indigenous content
off
Field of Research
01 Mathematical Sciences 08 Information and Computing Sciences
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.