Counting polytopes via the Radon complex

DOI10.1016/j.jcta.2004.01.005zbMath1042.05024OpenAlexW1973159370MaRDI QIDQ1826858

Ricardo Strausz, Juan José Montellano-Ballesteros

Publication date: 6 August 2004

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2004.01.005

zbMATH Keywords

Radon's theoremConvex polytopesPolytope typesRadon complexSeparoids

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorial aspects of finite geometries (05B25)

Related Items (6)

Realizability and inscribability for simplicial polytopes via nonlinear optimization ⋮ Erdős-Szekeres ``happy end-type theorems for separoïds ⋮ Hyperseparoids: a representation theorem ⋮ From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices ⋮ On the number of antipodal bicolored necklaces ⋮ A characterization of cocircuit graphs of uniform oriented matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Separoids, their categories and a Hadwiger-type theorem for transversals
• A characterization of cocircuit graphs of uniform oriented matroids
• Multidimensional Sorting
• Hadwiger's Transversal Theorem In Higher Dimensions
• The number of d ‐polytopes with d +3 vertices

This page was built for publication: Counting polytopes via the Radon complex