The exact bound for the reverse isodiametric problem in 3-space
Arkadiy Aliev

TL;DR
This paper proves the exact volume bound for convex bodies in 3D related to their diameter, confirming a conjecture, and explores implications for lattice packings and convex geometry.
Contribution
It establishes the precise volume bound for convex bodies in 3D under linear transformations, confirming Makai Jr.'s conjecture and deriving related lattice packing bounds.
Findings
Existence of a linear transformation achieving the volume bound.
Confirmation of the conjectured volume bound for simplices.
Lower bound on lattice packing density in 3D.
Abstract
Let be a convex body in . We denote the volume of by and the diameter of by In this paper we prove that there exists a linear bijection such that with equality if is a simplex, which was conjectured by Endre Makai Jr. As a corollary, we prove that any non-separable lattice of translates in has density of at least , which is a dual analog of Minkowski's fundamental theorem. Also we prove that , where is a convex body and is the lattice width of . In addition, there exists a three-dimensional simplex such that
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities
