The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices

DOI10.1137/21M144832XzbMath1503.52018arXiv2102.12813OpenAlexW3130258882MaRDI QIDQ5058127

David Yost, Guillermo Pineda-Villavicencio

Publication date: 2 December 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.12813

zbMATH Keywords

\(f\)-vectorpolytopelower bounddual polytope

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Gale and other diagrams (52B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting \(d\)-polytopes with \(d+3\) vertices
• A lower bound theorem for centrally symmetric simplicial polytopes
• Complete enumeration of small realizable oriented matroids
• A proof of Grünbaum's lower bound conjecture for general polytopes
• Minimum number of edges of polytopes with \(2d+2\) vertices
• Polytopes close to being simple
• Lower bound theorems for general polytopes
• Facets and nonfacets of convex polytopes
• The minimum number of vertices of a simple polytope
• A proof of the lower bound conjecture for convex polytopes
• Lectures on Polytopes
• Convex Polytopes
• The Excess Degree of a Polytope
• The Minimum Number of Facets of a Convex Polytope

This page was built for publication: The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices