Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sharp Favard length of random Cantor sets

Published 19 Dec 2025 in math.CA, math.MG, and math.PR | (2512.17753v1)

Abstract: We show that for a large class of planar $1$-dimensional random fractals $S$, the Favard length $\Fav(S(r))$ of the neighborhood $S(r)$ is comparable to $\log{-1}(1/r)$, matching a universal lower bound; up to now, this was only known in expectation for a few concrete models. In particular, we show that there exist $1$-Ahlfors regular sets with the fastest possible Favard length decay. For a wide class of planar one-dimensional ``grid random fractals'', including fractal percolation and its Ahlfors-regular variants, we further show that $\Fav(S(r))/\log(1/r)$ converges almost surely, and we identify the limit explicitly. Furthermore, we prove that for some $1$-dimensional Ahlfors-regular random fractals $S$, the Favard length of $S(r)$ decays instead like $\log\log(1/r)/\log(1/r)$, showing that the $1/\log(1/r)$ decay is not universal among random fractals, as might be expected from previous results.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.