Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T09:04:19.495Z Has data issue: false hasContentIssue false

Almost Simplicial Polytopes: The Lower and Upper Bound Theorems

Published online by Cambridge University Press:  21 May 2019

Eran Nevo
Affiliation:
Institute of Mathematics, Hebrew University of Jerusalem, Israel Email: nevo@math.huji.ac.il
Guillermo Pineda-Villavicencio
Affiliation:
Centre for Informatics and Applied Optimisation, Federation University Australia Email: work@guillermo.com.au
Julien Ugon
Affiliation:
School of Information Technology, Deakin University, Geelong, Australia Email: julien.ugon@deakin.edu.au
David Yost
Affiliation:
Centre for Informatics and Applied Optimisation, Federation University Australia Email: d.yost@federation.edu.au
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 bound theorems for these polytopes as functions of $d,n$, and $s$, thus generalizing the classical Lower Bound Theorem by Barnette and the Upper Bound Theorem by McMullen, which treat the case where $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.

Information

Type
Article
Copyright
© Canadian Mathematical Society 2018