Back to Search
Start Over
THE LOWER BOUND THEOREM FOR d-POLYTOPES WITH 2d + 1 VERTICES.
- Source :
-
SIAM Journal on Discrete Mathematics . 2022, Vol. 36 Issue 4, p2920-2941. 22p. - Publication Year :
- 2022
-
Abstract
- The problem of calculating exact lower bounds for the number of k-faces of dpolytopes with n vertices, for each value of k, and characterizing the minimizers has recently been solved for n not exceeding 2d. We establish the corresponding result for n = 2d+1; the nature of the lower bounds and the minimizing polytopes are quite different in this case. As a byproduct, we also characterize all d-polytopes with d + 3 vertices and only one or two edges more than the minimum. [ABSTRACT FROM AUTHOR]
- Subjects :
- *POLYTOPES
Subjects
Details
- Language :
- English
- ISSN :
- 08954801
- Volume :
- 36
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- SIAM Journal on Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 160773398
- Full Text :
- https://doi.org/10.1137/21M144832X