Cap covering inradius conjecture
Cap covering inradius conjecture
Let a spherical cap have radius , and let it be covered by a collection of convex spherical domains. For each domain, let its inradius be the radius of its largest inscribed spherical cap.
Cap covering inradius conjecture. The sum of the inradii of all domains in the collection is at least .
This problem is known for but remains open for .
Sources & referencesView supporting material
Primary source
Alexandr Polyanskii, “A cap covering theorem”, arXiv:2006.02192 (2021).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.