Almost simplicial polytopes I. The lower and upper bound theorems
Combinatorics
2018-11-20 v3
Abstract
We study -vertex -dimensional polytopes with at most one nonsimplex facet with, say, vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of and , thus generalizing the classical Lower Bound Theorem by Barnette and Upper Bound Theorem by McMullen, which treat the case of . We characterize the minimizers and provide examples of maximizers, for any . Our construction of maximizers is a generalization of cyclic polytopes, based on a suitable variation of the moment curve, and is of independent interest.
Cite
@article{arxiv.1510.08258,
title = {Almost simplicial polytopes I. The lower and upper bound theorems},
author = {Eran Nevo and Guillermo Pineda-Villavicencio and Julien Ugon and David Yost},
journal= {arXiv preprint arXiv:1510.08258},
year = {2018}
}
Comments
22 pages