Each generic polytope in $\mathbb{R}^3$ has a point with ten normals to the boundary
Ivan Nasonov, Gaiane Panina

TL;DR
The paper proves that in three-dimensional convex polytopes, a generic interior point has at least ten boundary normals, confirming a specific case of a long-standing conjecture about convex bodies.
Contribution
It establishes that every generic convex polytope in A3 has an interior point with at least ten boundary normals, providing the first exact bound for polytopes in this context.
Findings
Every generic polytope in A3 has an interior point with at least 10 normals.
The bound of 10 normals is sharp, as shown by a tetrahedron with no more than 10 normals from an interior point.
The proof employs piecewise linear Morse theory, bifurcation analysis, and combinatorial techniques.
Abstract
It is conjectured since long that each smooth convex body has a point in its interior which belongs to at least normals from different points on the boundary of . The conjecture is proven for . We treat the same problem for convex polytopes in and prove that each generic polytope has a point in its interior with at least normals to the boundary. This bound is exact: there exists a tetrahedron with no more than normals emanating from a point in its interior. The proof is based on piecewise linear analog of Morse theory, analysis of bifurcations, and some combinatorial tricks.
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
TopicsMathematics and Applications · Point processes and geometric inequalities · Polynomial and algebraic computation
