Every simplicial polytope with at most \(d+4\) vertices is a quotient of a neighborly polytope

DOI10.1007/PL00009328zbMath0898.52009OpenAlexW2008907142MaRDI QIDQ1380809

Ulrich Kortenkamp

Publication date: 3 November 1998

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009328

zbMATH Keywords

simplicial polytopequotient polytopematroid polytopeneighbourly polytopeGale diagrams

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Gale and other diagrams (52B35)

Related Items (5)

Enumerating Neighborly Polytopes and Oriented Matroids ⋮ A bridge between dynamic geometry and computer algebra ⋮ Many neighborly polytopes and oriented matroids ⋮ Universality theorems for inscribed polytopes and Delaunay triangulations ⋮ The universality theorem for neighborly polytopes

This page was built for publication: Every simplicial polytope with at most \(d+4\) vertices is a quotient of a neighborly polytope