2000 character limit reached
On $μ$-Dvoretzky random covering of the circle (1910.08056v1)
Published 17 Oct 2019 in math.PR, math.CA, and math.DS
Abstract: In this paper, we study the Dvoretzky covering problem with non-uniformly distributed centers. When the probability law of the centers admits an absolutely continuous density which satisfies a regular condition on the set of essential infimum points, we give a necessary and sufficient condition for covering the circle. When the lengths of covering intervals are of the form $\ell_n = \frac{c}{n}$, we give a necessary and sufficient condition for covering the circle, without imposing any regularity on the density function.
Sponsored by Paperpile, the PDF & BibTeX manager trusted by top AI labs.
Get 30 days freePaper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.