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

DOI10.1007/PL00009328MaRDI QIDQ1380809zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Gale diagramsmatroid polytopeneighbourly polytopequotient polytopesimplicial polytope

Mathematics Subject Classification ID

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

Review text

A conjecture of Perles and Sturmfels claims that every simplicial polytope is a quotient of an even-dimensional neighbourly polytope and that similarly, every matroid polytope is a quotient of a neighborly matroid polytope of odd rank. Using the technique of affine Gale diagrams, the author proves the conjecture for simplicial polytopes as well as matroid polytopes with a bound on the number of vertices. More precisely, he proves the following theorem: Every simplicial \(d\)-polytope with at most \(d+4\) vertices is a quotient of a neighbourly polytope of dimension at most \(2d+4\) with at most \(2d+8\) vertices; every matroid polytope of rank \(d+1\) with at most \(d+4\) vertices is a quotient of a neighbourly matroid polytope of rank at most \(2d+5\) with at most \(2d+8\) vertices.

Recommendations

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

Cited in

(6)

• The universality theorem for neighborly polytopes
• Enumerating neighborly polytopes and oriented matroids
• Many neighborly polytopes and oriented matroids
• scientific article; zbMATH DE number 870504 (Why is no real title available?)
• A bridge between dynamic geometry and computer algebra
• 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)