English

Almost simplicial polytopes I. The lower and upper bound theorems

Combinatorics 2018-11-20 v3

Abstract

We study nn-vertex dd-dimensional polytopes with at most one nonsimplex facet with, say, d+sd+s vertices, called {\it almost simplicial polytopes}. We provide tight lower and upper bound theorems for these polytopes as functions of d,nd,n and ss, thus generalizing the classical Lower Bound Theorem by Barnette and Upper Bound Theorem by McMullen, which treat the case of s=0s=0. We characterize the minimizers and provide examples of maximizers, for any dd. Our construction of maximizers is a generalization of cyclic polytopes, based on a suitable variation of the moment curve, and is of independent interest.

Keywords

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

R2 v1 2026-06-22T11:30:55.565Z