Combinatorial Inscribability Obstructions for Higher-Dimensional Polytopes
Joseph Doolittle, Jean-Philippe Labb\'e, Carsten E. M. C. Lange,, Rainer Sinn, Jonathan Spreer, G\"unter M. Ziegler

TL;DR
This paper introduces new combinatorial obstructions to inscribability in higher-dimensional polytopes, demonstrating that many known classes of polytopes are not inscribable, unlike the well-understood 3D case.
Contribution
It identifies novel combinatorial obstructions to inscribability in higher dimensions and characterizes inscribability for duals of cyclic and neighborly polytopes.
Findings
Duals of 4D cyclic polytopes with ≥8 vertices are not inscribable.
Duals of cyclic 4-polytopes with ≤7 vertices are inscribable.
Certain face lattice subposets serve as forbidden structures for inscribability.
Abstract
For -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 -vector of -polytopes, there exists an inscribable polytope with that -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 -dimensional cyclic polytopes with at least vertices---all of whose faces are inscribable---are not inscribable. This…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
