Inscribable stacked polytopes (Q2858024)

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.