pith. sign in

arxiv: 1510.08258 · v3 · pith:7FKTCBK5new · submitted 2015-10-28 · 🧮 math.CO

Almost simplicial polytopes I. The lower and upper bound theorems

classification 🧮 math.CO
keywords polytopesboundlowerupperalmostmaximizerssimplicialtheorem
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.