Every $3$-dimensional convex body can be covered by $14$ smaller homothetic copies
A. Prymak

TL;DR
This paper proves that any 3D convex body can be covered by 14 smaller homothetic copies, improving previous bounds and using a novel discretization and computational approach.
Contribution
It introduces a new discretization technique and computational method to reduce the covering problem to linear programming feasibility checks.
Findings
Every 3D convex body can be covered by 14 smaller homothetic copies.
The approach reduces the problem to linear programs with rational coefficients.
The method improves upon the previous bound of 16 copies.
Abstract
We show that every -dimensional convex body can be covered by smaller homothetic copies. The previous result was copies established by Papadoperakis in 1999, while a conjecture by Hadwiger is . We modify Papadoperakis's approach and develop a discretization technique that reduces the problem to verification of feasibility of a number of linear programs with rational coefficients, which is done with computer assistance using exact arithmetic.
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHistory and Theory of Mathematics · Point processes and geometric inequalities · Computability, Logic, AI Algorithms
