arXiv Analytics

Sign in

arXiv:2102.12813 [math.CO]AbstractReferencesReviewsResources

A lower bound theorem for $d$-polytopes with $2d+1$ vertices

Guillermo Pineda-Villavicencio, David Yost

Published 2021-02-25Version 1

We establish the exact lower bound for the number of $k$-faces of $d$-polytopes with $2d+1$ vertices, for each value of $k$, and characterise the minimisers. As a byproduct, we characterise all $d$-polytopes with $d+3$ vertices, and only one or two edges more than the minimum.

Comments: 26 pages, 2 figures
Categories: math.CO
Subjects: 52B05
Related articles: Most relevant | Search more
arXiv:2409.14294 [math.CO] (Published 2024-09-22)
A lower bound theorem for $d$-polytopes with $2d+2$ vertices
arXiv:math/0505334 [math.CO] (Published 2005-05-16, updated 2006-05-05)
Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes
arXiv:1411.7736 [math.CO] (Published 2014-11-28)
Local $h$-polynomials, invariants of subdivisions, and mixed Ehrhart theory