Paperlane

no. 17 · Wednesday 18 November 2026

Rado's covering problem for cubes and balls: a survey

Gian Maria Dall'Ara and Adrian Dumitrescu

math.MG · v3 · 15 pp

Abstract

What is the largest constant $c\in [0,1]$ with the property that every finite collection $\mathcal{C}$ of axis-parallel squares in the plane admits a disjoint sub-collection $\mathcal{S}$ occupying at least a fraction $c$ of the area covered by $\mathcal{C}$? This problem was first raised by T.~Radó in 1928, who was motivated by a classical covering lemma in real analysis due to Vitali. R.~Rado later generalized the problem from axis-parallel squares in the plane to homothetic copies of any given convex body $K$ in $\mathbb{R}^d$, where now we are looking for an optimal constant $F(K)$. In this paper we survey the literature on this problem, with a focus on the case where $K$ is a cube or a ball in the high-dimensional regime $d\rightarrow \infty$. The estimates that we currently have for cubes are much more precise than those for balls: namely if $Q^d$ is a $d$-dimensional cube, then \[ (e^{-1}+o(1))\frac{2^{-d}}{d \log{d}} \leq F(Q^d)\leq 2^{-d}, \] while denoting $B^d$ a $d$-dimensional Euclidean ball, then \[ 2.910^{-d} \leq F(B^d) \leq 2.447^{-d}.\] Except for the upper bound for cubes, which is classical, the other estimates are due to the authors.

comments
15 pages, 6 figures
fields
Metric Geometry, Classical Analysis and ODEs, Combinatorics
pdf ↗ page arXiv:2604.17509 ↗