There are asymptotically far fewer polytopes than we thought

DOI10.1090/S0273-0979-1986-15415-7zbMath0585.52003OpenAlexW2062279195WikidataQ56815627 ScholiaQ56815627MaRDI QIDQ3709425

Jacob E. Goodman, Richard Pollack

Publication date: 1986

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0273-0979-1986-15415-7

zbMATH Keywords

combinatorially distinct simplicial polytopes

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Polyhedra and polytopes; regular figures, division of spaces (51M20) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx)

Related Items

Voronoi diagrams and arrangements, Many triangulated spheres, On locally constructible spheres and balls, Some provably hard crossing number problems, Geometry and the simplex: results, questions and ideas, Kalai's squeezed 3-spheres are polytopal, Many triangulated 3-spheres, Polytopal Bier spheres and Kantorovich-Rubinstein polytopes of weighted cycles, An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions

Cites Work

• Unnamed Item
• Neighborly polytopes
• Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
• Multidimensional Sorting
• The number of polytopes, configurations and real matroids
• On the Number of Vertices of a Convex Polytope
• On the Betti Numbers of Real Varieties