Bang's 1-codimensional cylinder covering conjecture
Let be the -st cylindrical covering parameter of a convex body in , obtained by infimizing the total relative cylinder volume over finite coverings by -codimensional cylinders. 1-codimensional cylinder covering conjecture. For every convex body in ,
The conjecture is attributed to Bang; the paper notes that the estimate would be sharp for a regular tetrahedron and records only general lower bounds in this direction.
References
- Karoly Bezdek and Muhammad A. Khan, “The geometry of homothetic covering and illumination”, arXiv:1602.06040 (2016).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 4
Claimed by OpenAI. The manuscript claims a finite cover of a regular tetrahedron by cylinders with triangular perpendicular bases whose direction-normalized total base area is below one half. This gives a claimed counterexample to the cylindrical covering parameter bound. The directionwise construction extends to every nondegenerate tetrahedron; the absolute-area comparison is stated for regular tetrahedra.See full solution
GitHub repository: https://github.com/openai/math
- OpenAI-100-01-Finite-angular-cylinder-covers-below-the-half-area-bound.pdfOpen
Claimed by OpenAI. The manuscript claims finite cylinder approximations of compact ruled segment families for C1 velocity fields with trace-zero differential and determinant in (-L^(-2),0]. Square intercept tiles produce perpendicular parallelogram bases, with total perpendicular-base area at most the stated integral cost plus any prescribed positive error. This is a related covering approximation lemma, not itself an unrestricted counterexample to the page’s bound.See full solution
GitHub repository: https://github.com/openai/math
- OpenAI-100-02-Finite-cylinder-approximation-of-ruled-sets.pdfOpen
Claimed by OpenAI. The manuscript claims finite parallelogram-base cylinder covers of a regular tetrahedron with direction-normalized total base area below one half, contradicting the page’s proposed covering bound. It also claims an absolute half-minimum-projection-area violation for regular tetrahedra; only the directionwise conclusion extends to arbitrary nondegenerate tetrahedra.See full solution
GitHub repository: https://github.com/openai/math
- OpenAI-100-03-Slope-field-perturbations-of-the-two-cylinder-covering.pdfOpen
Claimed by OpenAI. The manuscript claims finite triangular-cylinder approximations of radial sweeps satisfying w prime(t)=lambda(t)(a+tb), uniformly over fine partitions and tags. Its tetrahedral application claims a finite regular-tetrahedron cover with direction-normalized base-area cost below one half, giving a claimed counterexample to the page’s bound, together with an absolute-area violation.See full solution
GitHub repository: https://github.com/openai/math
- OpenAI-100-04-Finite-triangular-approximation-of-radial-sweeps.pdfOpen