pith. sign in

arxiv: 1111.5322 · v1 · pith:XZYMIPYQnew · submitted 2011-11-22 · 🧮 math.MG · math.CO· math.NA

Inscribable stacked polytopes

Bernd Gonska , G\"unter M. Ziegler This is my paper
classification 🧮 math.MG math.COmath.NA
keywords inscribablestackedtriangulationscharacterizecombinatoriald-polytopesdelaunayequivalently
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Copositive Matrices with Ordered Off-Diagonal Entries

    math.OC 2026-05 unverdicted novelty 7.0

    Copositive matrices with nondecreasing off-diagonal entries admit a PSD plus nonnegative decomposition, which implies exactness of a natural relaxation for separable quadratic optimization over the simplex.