arXiv (All)
open access
Inscribed 4-polytopes of maximal volume with seven and eight vertices
We prove, with sum-of-squares certificates checked in exact arithmetic, that every cyclic $4$-polytope with seven vertices inscribed in $\mathbb{S}^{3}$ has volume at most $2/5$. Hence no $4$-polytope of maximal volume with seven vertices inscribed in $\mathbb{S}^{3}$ is cyclic, answering a question
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Littlewood's mutually touching cylinders: the maximum is seven#1402328
- A volume formula for Reuleaux polyhedra#1117300
- Monotone Diameters of Lattice Polytopes#985981
- Almost Empty Monochromatic Polygons in Planar Point Sets#1388487
- A short proof of Ball's plank theorem#1131005
Record · ID 1402274
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive