An estimate from below for the Buffon needle probability of the four-corner Cantor set
Michael Bateman, Alexander Volberg

TL;DR
This paper improves the lower bound estimate for the Favard length of the four-corner Cantor set, showing it decays at least as fast as a logarithmic factor over n, advancing understanding of geometric measure properties.
Contribution
It introduces a novel approach to improve the lower bound of the Favard length decay rate from 1/n to (log n)/n for the four-corner Cantor set.
Findings
Lower bound for Favard length is improved to c (log n)/n.
The result contrasts with the behavior of random Cantor sets.
The paper connects geometric measure theory with combinatorial methods.
Abstract
Let be the -th generation in the construction of the middle-half Cantor set. The Cartesian square consists of squares of side-length . The chance that a long needle thrown at random in the unit square will meet is essentially the average length of the projections of , also known as the Favard length of . A classical theorem of Besicovitch implies that the Favard length of tends to zero. It is still an open problem to determine its exact rate of decay. Until recently, the only explicit upper bound was , due to Peres and Solomyak. ( is the number of times one needs to take log to obtain a number less than 1 starting from ). In Nazarov-Peres-Volberg paper (arxiv:math 0801.2942) the power estimate from above was obtained. The exponent in this paper was less than 1/6 but could…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Topological and Geometric Data Analysis · Mathematical Analysis and Transform Methods
