On asymptotic Lebesgue's universal covering problem
Metric Geometry
2025-12-04 v1 Combinatorics
Abstract
Universal cover in 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 (). A simple universal cover in is provided by the classical theorem of Jung, which states that any set of diameter 1 in an -dimensional Euclidean space is contained in a ball of radius ; in other words, is a universal cover in . We show that in high dimensions, Jung's ball is asymptotically optimal with respect to the volume, namely, for any universal cover ,
Keywords
Cite
@article{arxiv.2512.04023,
title = {On asymptotic Lebesgue's universal covering problem},
author = {Andrii Arman and Andriy Bondarenko and Andriy Prymak and Danylo Radchenko},
journal= {arXiv preprint arXiv:2512.04023},
year = {2025}
}