Inscribable stacked polytopes

DOI10.1515/ADVGEOM-2013-0014MaRDI QIDQ2858024zbMATH OpenOpenAlexFDO

Authors Bernd Gonska, Günter M. Ziegler

Publication date 19 November 2013

Published in Advances in Geometry (Search for Journal in Brave)

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

zbMATH Keywords

Delaunay triangulationsinscribable polytopesstacked polytopesstellar subdivision

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11)

Abstract: We characterize the combinatorial types of stacked d-polytopes that are inscribable. Equivalently, we identify the triangulations of a simplex by stellar subdivisions that can be realized as Delaunay triangulations.

Review text

The paper is devoted to characterization of the combinatorial types of \(d\)-stacked polytopes that are inscribable, i.e combinatorially equivalent to a convex \(d\)-polytope with its vertices lying on a \((d-1)\)-sphere. This is done in the main Theorem 1 in terms of the dual tree. By stereographic projection it can be easily seen that studying inscribable \(d\)-polytopes is equivalent to studying \((d-1)\)-dimensional Delaunay triangulations. So, the first question is equivalent to finding simplex triangulations by stellar subdivisions that can be realized as Delaunay triangulations which is done in the main Theorem 2. Some important corollaries are proved alongside, namely: all f-vectors of 3-polytopes also occur for inscribable polytopes (Section 2.5.1), cyclic polytopes are inscribable (Section 2.5.2) and there are stacked d-polytopes with \(d+1+n\) vertices for \(d\geq 2, n\geq 0\) that are inscribable (Section 2.4). This shows Upper and Lower Bound Theorems for f-vectors to be sharp in the class of inscribable polytopes.

Recommendations

• About \(f\)-vectors of inscribed simplicial polytopes
• Neighborly inscribed polytopes and Delaunay triangulations
• Note on inscribability of quadrangular polyhedra with restricted number of edge-types
• Six topics on inscribable polytopes
• scientific article; zbMATH DE number 1359481

Cited in

(10)

• Realizability and inscribability for simplicial polytopes via nonlinear optimization
• Neighborly inscribed polytopes and Delaunay triangulations
• Scribability problems for polytopes
• On ill-conceived initialization in archetypal analysis
• About \(f\)-vectors of inscribed simplicial polytopes
• Six topics on inscribable polytopes
• Apollonian ball packings and stacked polytopes
• scientific article; zbMATH DE number 4026241 (Why is no real title available?)
• COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES
• Universality theorems for inscribed polytopes and Delaunay triangulations

This page was built for publication: Inscribable stacked polytopes

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