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

DOI10.1007/PL00009328zbMATH Open0898.52009OpenAlexW2008907142MaRDI QIDQ1380809FDOQ1380809

Authors: 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

Recommendations

• Neighborly polytopes
• Neighbourly polytopes with few vertices
• Triangulations of simplicial polytopes
• Almost Simplicial Polytopes: The Lower and Upper Bound Theorems

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)

Cited In (6)

• A bridge between dynamic geometry and computer algebra
• Many neighborly polytopes and oriented matroids
• The universality theorem for neighborly polytopes
• Enumerating neighborly polytopes and oriented matroids
• Title not available (Why is that?)
• Universality theorems for inscribed polytopes and Delaunay triangulations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380809)