Counting \(d\)-polytopes with \(d+3\) vertices
From MaRDI portal
Publication:819185
zbMath1093.52005arXivmath/0511466MaRDI QIDQ819185
Publication date: 22 March 2006
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0511466
Exact enumeration problems, generating functions (05A15) (n)-dimensional polytopes (52B11) Asymptotic enumeration (05A16) Gale and other diagrams (52B35)
Related Items
Polytopes with few vertices and few facets ⋮ The Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ Vertices ⋮ Realizability and inscribability for simplicial polytopes via nonlinear optimization ⋮ Lower bound theorems for general polytopes ⋮ Complete enumeration of small realizable oriented matroids ⋮ The complete enumeration of 4-polytopes and 3-spheres with nine vertices ⋮ Extension Complexity of Polytopes with Few Vertices or Facets
This page was built for publication: Counting \(d\)-polytopes with \(d+3\) vertices