Circle coverings driven by arithmetic sequences: a percolation approach to Diophantine approximation and fractal intersections
Manuel Hauke, Andrei Shubin, Eduard Stefanescu, Agamemnon Zafeiropoulos

TL;DR
This paper investigates how well sequences of shrinking intervals centered at arithmetic sequence points cover the unit interval, with applications to Diophantine approximation and fractal set intersections, extending previous results to broader classes of sequences.
Contribution
It establishes sharp bounds for covering intervals driven by lacunary sequences, extends Hausdorff dimension results to various sequences, and improves bounds in inhomogeneous Diophantine approximation problems.
Findings
Covering radius of 1/n is sharp up to a constant for lacunary sequences.
Almost-sure Hausdorff dimension of limsup sets is computed for various sequences.
Improves bounds in inhomogeneous Littlewood-Cassels problem for badly approximable numbers.
Abstract
We study problems on covering by shrinking intervals centered at the points , where is a given real-valued sequence and is random. For real-valued lacunary sequences , we show that the covering radius is sharp up to a constant: there exist such that, for Lebesgue-almost all , the intervals of length cover infinitely often, while this fails for intervals of length . Moreover, the lower bound holds for certain sub-lacunary rates and the results partially extend to all probability measures with sufficiently fast Fourier decay. As an application, we obtain a new bound for a variant of the inhomogeneous Littlewood-Cassels problem: for any badly approximable and , there exists a set of badly approximable of full…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
