Uniform Random Covering Problems
DOI10.1093/IMRN/RNAB272OpenAlexW3202229968MaRDI QIDQ5871352FDOQ5871352
Authors:
Publication date: 19 January 2023
Published in: IMRN. International Mathematics Research Notices (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.01595
Recommendations
Hausdorff dimensionLebesgue measureunit circleuniformly distributed sequenceDirichlet theoremi.i.d. sequence
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)
Cited In (7)
- Uniform random covering problems
- On uniform covering, adaptive random search and raspberries
- Random Covering and Packing on the Line
- Uniform approximation problems of expanding Markov maps
- Title not available (Why is that?)
- How many intervals cover a point in random dyadic covering?
- A CLT for a one-dimensional class cover problem
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 Q5871352)