Uniform random covering problems

DOI10.1093/IMRN/RNAB272MaRDI QIDQ6361923arXivFDO

Authors Henna Koivusalo, Lingmin Liao, Tomas Persson

Publication date 2 March 2021

Published in arXiv

Full work available at URL https://doi.org/10.1093/IMRN/RNAB272

Mathematics Subject Classification ID

Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) Relations between ergodic theory and number theory (37A44) Relations between ergodic theory and harmonic analysis (37A46)

arXiv classification

math.CAmath.DSmath.PR

Abstract: Motivated by the random covering problem and the study of Dirichlet uniform approximable numbers, we investigate the uniform random covering problem. Precisely, consider an i.i.d. sequence $omega=(omeg{a}_n{)}_{ngeq1}$ uniformly distributed on the unit circle $mathbbT$ and a sequence $(r_n{)}_{ngeq1}$ of positive real numbers with limit $0$. We investigate the size of the random set [ mathcal U (omega):={yin mathbb{T}: forall Ngg 1, exists n leq N, ext{s.t.} | omega_n -y | < r_N }. ] Some sufficient conditions for $mathcalU(omega)$ to be almost surely the whole space, of full Lebesgue measure, or countable, are given. In the case that $mathcalU(omega)$ is a Lebesgue null measure set, we provide some estimations for the upper and lower bounds of Hausdorff dimension.

This page was built for publication: Uniform random covering problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6361923)