Indexed metadata

The higher-dimensional Shepp problem: an exact criterion for random ball coverings of tori

Yechi Zhou

Source record

Source: arXiv

Published: Sep 2, 2026

arXiv: 2609.02156

Open original source ↗

Source abstract

We solve the Euclidean-ball case of the higher-dimensional Shepp covering problem. More precisely, we give an exact criterion for full limsup coverage of the dd-dimensional torus, d2d\ge 2, by independently centered Euclidean balls with an arbitrary decreasing sequence of radii. Let X1,X2,X_1,X_2,\ldots be independent Haar-uniform points, let r1r20r_1\ge r_2\ge\cdots\downarrow 0, and put un(z)=m(B(0,rn)B(z,rn))u_n(z)=m(B(0,r_n)\cap B(z,r_n)) and H(z)=n1un(z)H(z)=\sum_{n\ge 1}u_n(z). Then every point belongs to infinitely many of the balls B(Xn,rn)B(X_n,r_n) almost surely if and only if Tdexp(H)dm=\int_{\mathbb{T}^d}\exp(H) dm=\infty. In dimension one this condition is equivalent to Shepp's criterion. No regular-variation or comparable-scale assumption is imposed on the radii. The main difficulty is shared noise: after spatial decomposition, the same Poisson input acts on many uncovered cells, so their descendants are not conditionally independent. We overcome this by establishing an extinction bound for monotone population recursions driven by positively associated innovations. Together with Poissonization and spatial localization this proves sufficiency, while a second-moment estimate and the zero-one law prove necessity.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.