Almost simplicial polytopes I. The lower and upper bound theorems

2015/10/28 by Nevo, Eran, Pineda-Villavicencio, Guillermo, Ugon, Julien +1
#52B05 (Primary) #52B12 #52B22 (Secondary) #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1510.08258

Abstract

We study n-vertex d-dimensional polytopes with at most one nonsimplex facet with, say, d+s vertices, called \it 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.

Related

• Polytopes with few vertices and few facets
• On the Monotone Upper Bound Problem
• A lower bound theorem for d-polytopes with 2d+1 vertices
• Balanced generalized lower bound inequality for simplicial polytopes
• Isotropic constants and regular polytopes