COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES

DOI10.1112/MTK.12051zbMATH Open1525.52006arXiv1910.05241OpenAlexW3047821054MaRDI QIDQ6134981FDOQ6134981

Authors: Joseph Doolittle, Jean-Philippe Labbé, Carsten E. M. C. Lange, Rainer Sinn, Jonathan Spreer, Günter M. Ziegler 

Publication date: 23 August 2023

Published in: Mathematika (Search for Journal in Brave)

Abstract: For $3$-dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hyperbolic geometry. In particular, inscribability can be tested in polynomial time, and for every $f$-vector of $3$-polytopes, there exists an inscribable polytope with that $f$-vector. For higher-dimensional polytopes, much less is known. Of course, for any inscribable polytope, all of its lower-dimensional faces need to be inscribable, but this condition does not appear to be very strong. We observe non-trivial new obstructions to the inscribability of polytopes that arise when imposing that a certain inscribable face be inscribed. Using this obstruction, we show that the duals of the $4$-dimensional cyclic polytopes with at least $8$ vertices---all of whose faces are inscribable---are not inscribable. This result is optimal in the following sense: We prove that the duals of the cyclic $4$-polytopes with up to $7$ vertices are, in fact, inscribable. Moreover, we interpret this obstruction combinatorially as a forbidden subposet of the face lattice of a polytope, show that $d$-dimensional cyclic polytopes with at least $d+4$ vertices are not circumscribable, and that no dual of a neighborly $4$-polytope with $8$ vertices, that is, no polytope with $f$-vector $(20,40,28,8)$, is inscribable.

Full work available at URL: https://arxiv.org/abs/1910.05241

Recommendations

• Inscribable stacked polytopes
• scientific article; zbMATH DE number 4026241
• Note on inscribability of quadrangular polyhedra with restricted number of edge-types
• Six topics on inscribable polytopes
• About \(f\)-vectors of inscribed simplicial polytopes

zbMATH Keywords

inscribability of polytopes

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorics of partially ordered sets (06A07) General theory of nonlinear incidence geometry (51B05)

Cites Work

• The complete enumeration of the 4-polytopes and 3-spheres with eight vertices
• Realizability and inscribability for simplicial polytopes via nonlinear optimization
• Lectures on Polytopes
• Title not available (Why is that?)
• An enumeration of simplicial 4-polytopes with 8 vertices
• Triangulations. Structures for algorithms and applications
• A characterization of ideal polyhedra in hyperbolic 3-space
• Riemannian geometry
• Many neighborly polytopes and oriented matroids
• Discriminants, resultants, and multidimensional determinants
• Perspectives on projective geometry. A guided tour through real and complex geometry
• Voronoi diagrams from convex hulls
• Graph-theoretical conditions for inscribability and Delaunay realizability
• Inscribable stacked polytopes
• A characterization of convex hyperbolic polyhedra and of convex polyhedra inscribed in the sphere
• Geometry. I, II. Transl. from the French by M. Cole and S. Levy
• Title not available (Why is that?)
• Universality theorems for inscribed polytopes and Delaunay triangulations
• Title not available (Why is that?)
• Some problems on polyhedra
• Scribability problems for polytopes
• Six topics on inscribable polytopes

Cited In (4)

• Antiprismlessness, or: reducing combinatorial equivalence to projective equivalence in realizability problems for polytopes
• Inscribable order types
• Title not available (Why is that?)
• An upper bound on the shortness exponent of inscribable polytopes

This page was built for publication: COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES

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