Papers
Topics
Authors
Recent
2000 character limit reached

On asymptotic Lebesgue's universal covering problem (2512.04023v1)

Published 3 Dec 2025 in math.MG and math.CO

Abstract: Universal cover in $\mathbb{E}{n}$ is a measurable set that contains a congruent copy of any set of diameter 1. Lebesgue's universal covering problem, posed in 1914, asks for the convex set of smallest area that serves as a universal cover in the plane ($n=2$). A simple universal cover in $\mathbb{E}n$ is provided by the classical theorem of Jung, which states that any set of diameter 1 in an $n$-dimensional Euclidean space is contained in a ball $J_n$ of radius $\sqrt{\tfrac{n}{2n+2}}$; in other words, $J_n$ is a universal cover in $\mathbb{E}n$. We show that in high dimensions, Jung's ball $J_n$ is asymptotically optimal with respect to the volume, namely, for any universal cover $U \subset \mathbb{E}n$, $$ {\rm Vol}(U) \ge (1-o(1))n{\rm Vol}(J_n). $$

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.