arXiv · 2611.14674
The inscribed $4$-polytope of maximal volume with ten vertices
Abstract
We prove that a $4$-polytope with ten vertices inscribed in the unit sphere $\mathbb{S}^{3}$ has volume at most $\frac{25}{384}(10 + 2\sqrt{5})$, and that, up to orthogonal transformations, equality holds only for the convex hull of two regular pentagons inscribed in $\mathbb{S}^{3}$ in orthogonal $2$-planes through the origin. As for six to nine vertices, the optimum is thus the convex hull of two regular polygons in orthogonal planes. On the combinatorial type of the pair, whose boundary complex is the join of two $5$-cycles, the sharp bound follows from our work on nine vertices. Since an optimal polytope is simplicial, by a result of Horváth and Lángi, it remains to exclude the other $162003$ simplicial types. We do this by sum-of-squares certificates checked in exact arithmetic, extended by nonnegative multiples of facet polynomials, which are positive on every positively oriented realisation of
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Csaba Medgyes. 2026-11-10. The inscribed $4$-polytope of maximal volume with ten vertices. https://searcharxiv.com/abs/2611.14674
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.