2000 character limit reached
The non-covered set in Dvoretzky covering is a set of multiplicity (2511.09726v1)
Published 12 Nov 2025 in math.PR
Abstract: We prove that the non-covered set in Dvortezky random covering is a set of multiplicity, by showing that the natural multiplicative chaotic measure is a Rajchman measure.
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.