Nevo, Eran and Pineda-Villavicencio, Guillermo and Ugon, Julien and Yost, David - Almost simplicial polytopes: the lower and upper bound theorems

dmtcs:6369 - Discrete Mathematics & Theoretical Computer Science, April 22, 2020, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
Almost simplicial polytopes: the lower and upper bound theorems

Authors: Nevo, Eran and Pineda-Villavicencio, Guillermo and Ugon, Julien and Yost, David

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.


Volume: DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
Published on: April 22, 2020
Submitted on: July 4, 2016
Keywords: Combinatorics,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]


Share

Consultation statistics

This page has been seen 15 times.
This article's PDF has been downloaded 24 times.