--- title: Favard Length Problem url: https://www.emergentmind.com/topics/favard-length-problem type: topic --- # Favard Length Problem The Favard length problem concerns the quantitative behavior of the average length of orthogonal projections of planar sets. For a planar set \(E\subseteq \mathbb{R}^2\), the Favard length is defined by \[ \operatorname{Fav}(E)=\int_0^{\pi} |\pi_\theta(E)|\,d\theta, \] where \(\pi_\theta\) denotes orthogonal projection onto the line in direction \(\theta\). It is also interpreted as Buffon needle probability, and it is closely related to rectifiability, Hausdorff dimension, and analytic capacity [1711.09858]. In its classical form, the problem asks how fast \(\operatorname{Fav}(E_n)\) or \(\operatorname{Fav}(E(r))\) decays for approximating generations \(E_n\) of self-similar planar Cantor sets, or for \(r\)-neighborhoods \(E(r)\), when the limiting set is purely \(1\)-unrectifiable. ## 1. Classical formulation and qualitative theory The qualitative background is the Besicovitch projection theorem: if \(E\subset \mathbb{R}^2\) has \(0<\mathcal{H}^1(E)<\infty\) and is purely \(1\)-unrectifiable, then \(\operatorname{Fav}(E)=0\). In this sense, Favard length is a projection-theoretic detector of rectifiable structure [2408.03919]. For self-similar approximants \(E_n\), however, the limit statement \(\operatorname{Fav}(E_n)\to 0\) leaves open the central quantitative question: how fast the decay occurs [1212.0247]. The canonical examples are dimension-\(1\) planar Cantor sets such as the four-corner set, the modified Sierpiński gasket, and rational product sets. For these, Mattila’s lower bound gives \[ \operatorname{Fav}(E_n)\ge \frac{C}{n}, \] while for the four-corner set Bateman and Volberg improved the lower bound to \[ \operatorname{Fav}(E_n)\ge \frac{C\log n}{n}. \] The exact decay rate remains unresolved in the deterministic self-similar setting, and this unresolved rate is the core of the classical Favard length problem for planar Cantor sets [1212.0247]. A parallel formulation uses neighborhoods. If \(E\) is a compact purely \(1\)-unrectifiable set with \(0<\mathcal{H}^1(E)<\infty\), then the problem becomes the asymptotic behavior of \(\operatorname{Fav}(E(r))\) as \(r\downarrow 0\). This neighborhood version is particularly useful when one wants to compare deterministic, random, and nonlinear projection models. ## 2. Deterministic self-similar sets and arithmetic methods For deterministic self-similar sets, the best upper bounds are highly sensitive to algebraic structure. Łaba’s survey records power-law bounds \[ \operatorname{Fav}(E_n)\le C n^{-p} \] for several canonical families, including the four-corner set, the Sierpiński gasket, self-similar sets with \(L=4\), and rational product sets satisfying a tiling condition. It also records the weaker bound \[ \operatorname{Fav}(E_n)\lesssim n^{-p/\log\log n} \] for all rational product sets with \(|A|,|B|\le 6\), and the much weaker general estimate \[ \operatorname{Fav}(E_n)\lesssim e^{-c\sqrt{\log n}} \] for general self-similar sets [1212.0247]. The paper "The Favard length of product Cantor sets" generalizes the Nazarov–Peres–Volberg framework from the four-corner set to product Cantor sets whose projection in some direction has positive \(1\)-dimensional measure. If \(\tan \theta_0=q/r\) in lowest terms and \(\operatorname{proj}_{\theta_0}(E_\infty)\) has positive measure, then there exists \(p>6+4(1+q+r)\gamma^{-1}\) such that \[ \operatorname{Fav}(E_n)\le C n^{-1/p}, \] where \(\gamma=\min(\alpha,\beta)\) for the two factor dimensions [0902.0964]. The decisive input is the arithmetic structure of exceptional projections, mediated by tiling theory and generating-function identities. In the rational product setting, the harmonic-analytic reduction passes through mask polynomials and cyclotomic divisibility. Łaba emphasizes the generating polynomials \[ A(x)=\sum_{a\in A}x^a,\qquad B(x)=\sum_{b\in B}x^b, \] the trigonometric polynomial \[ \phi_A(\xi)=\frac{1}{|A|}\sum_{a\in A} e^{2\pi i a\xi}, \] and the Set of Small Values (SSV) and Set of Large Values (SLV) mechanisms [1212.0247]. The paper "Vanishing sums of roots of unity and the Favard length of self-similar product sets" sharpens the Lam–Leung lower bound on vanishing sums of roots of unity and extends the Bond–Łaba–Volberg method to sets for which the least common multiples \(s_A\) and \(s_B\) of the relevant cyclotomic divisors each have at most two distinct prime divisors. In that regime one obtains \[ \operatorname{Fav}(S_n)\lesssim n^{-\epsilon/\log\log n}, \] and if all roots of \(A(X)\) and \(B(X)\) on the unit circle are roots of unity, the bound improves to \[ \operatorname{Fav}(S_n)\lesssim n^{-\epsilon}. \] The same work raises the size threshold handled by this method from \(|A|,|B|\le 6\) to \(|A|,|B|\le 10\) [2202.07555]. These results show that the deterministic problem is not governed by self-similarity alone. Fourier decay, cyclotomic factorization, and tiling phenomena enter at full strength, and the boundary between power-law decay and weaker decay is strongly arithmetic. ## 3. Geometric bounds, convexity, and limits of self-similar heuristics A distinct line of work replaces Fourier analysis by direct geometry. "Geometric Bounds for Favard Length" proves that if \(E\subseteq \mathbb{R}^2\) is measurable, \(A\subseteq S^1\) has positive measure, \(r_n\to 0\), and \[ \int_A |\pi_\theta(E(r_n))|\,d\theta \le C r_n^s \] for some \(s\in (0,1)\), then \[ \dim E \le 1-s. \] The proof is geometric and uses coverings and Hölder’s inequality rather than Frostman measures or energy integrals [1711.09858]. The same paper proves a convexity property for generations of self-similar sets. If \(A_{n+1}=\bigcup_{i=1}^N r_iA_n+\beta_i\) with \(r_i>0\) and \(\sum_i r_i=1\), then for each direction \(\theta\), \[ \alpha_n(\theta)=|\pi_\theta A_n| \] is convex in \(n\), in the sense that \[ \alpha_n(\theta)\le \frac{\alpha_{n-1}(\theta)+\alpha_{n+1}(\theta)}{2}. \] This yields lower bounds on Favard length for several self-similar fractals; for the four-corner Cantor generations it gives \[ \operatorname{Fav}(K_n)\gtrsim \frac{1}{n} \] by a purely geometric argument [1711.09858]. The self-similar picture has strict limitations. "Sets with Arbitrarily Slow Favard Length Decay" constructs measurable purely unrectifiable sets \(E\subset \mathbb{R}^2\) with \(\mathcal{H}^1(E)=1\) such that for any increasing sequence \(g(n)\to\infty\), \[ \operatorname{Fav}(\mathcal{N}(E,4^{-n}))\gtrsim \frac{1}{g(n)}. \] Equivalently, for any monotone \(\phi:(0,1]\to \mathbb{R}_+\) with \(\phi(\varepsilon)\to 0\), there exists such an \(E\) with \[ \operatorname{Fav}(\mathcal{N}(E,\varepsilon))\gtrsim \phi(\varepsilon) \] for all small \(\varepsilon\) [1707.08137]. This shows that the familiar logarithmic and power-law patterns from self-similar Cantor sets do not extend to arbitrary purely unrectifiable \(1\)-sets. A common misconception is that self-similar lower bounds reflect a universal phenomenon. The non-self-similar constructions show that no universal lower decay law of Mattila type can hold in that generality. ## 4. Rectifiability, quantitative rigidity, and large Favard length Another major theme asks what large Favard length forces geometrically. "Structure of sets with nearly maximal Favard length" studies finite-length sets \(E\subset B(1)\) against a line segment \(L\) with \(\mathcal{H}^1(L)=\mathcal{H}^1(E)\). Since \[ \operatorname{Fav}(L)=2\,\mathcal{H}^1(L), \] line segments maximize Favard length among sets of a given length. If \[ \operatorname{Fav}(E)\ge \operatorname{Fav}(L)-\delta, \] then \(E\) can be covered by an \(\epsilon\)-Lipschitz graph up to a set of length \(\epsilon\), with polynomial dependence \[ \epsilon=C\delta^{1/70}. \] Thus near-maximizers are quantitatively close to straight line segments [2203.01279]. The Ahlfors-regular theory goes further. "Favard length and quantitative rectifiability" proves a quantitative Besicovitch theorem: if \(E\subset \mathbb{R}^2\) is Ahlfors \(1\)-regular with constant \(A\) and \[ \operatorname{Fav}(E)\ge K\,\mathcal{H}^1(E), \] then there exists a Lipschitz graph \(\Gamma\) with \(\operatorname{Lip}(\Gamma)\lesssim_{A,K}1\) such that \[ \mathcal{H}^1(E\cap \Gamma)\gtrsim_{A,K}\mathcal{H}^1(E). \] Moreover, for Ahlfors regular sets, the condition \[ \operatorname{Fav}(E\cap B(x,r))\gtrsim r \quad \text{for all } x\in E,\ 06, \] and \[ \operatorname{Fav}_\gamma(K_n)\ge C n^{-1}. \] In that setting the key ingredients are a local comparison between curve projections and orthogonal projections, and a counting-function \(L^2\) method for the lower bound [2003.03620]. The nonlinear Besicovitch theorem has also been quantified. "A Quantification of a Besicovitch Nonlinear Projection Theorem via Multiscale Analysis" proves that if \(E\subset [0,1]^2\) has controlled multiscale length and sufficiently small quantitative rectifiability constants \(R_E(r_{n+2},r_{n-2},r_n)\), then for suitable piecewise \(C^1\) curves \(\gamma\), \[ \operatorname{Fav}_\gamma(E)\le N^{-1/100}L. \] As an application, for the four-corner Cantor set one obtains the upper bound \[ \operatorname{Fav}_\gamma(K_n)\le (\log_* n)^{-1/100}, \] and, together with the companion work of Cladek, Davey, and Taylor, a power-law upper bound \(\operatorname{Fav}_\gamma(K_n)\le c n^{-p}\) for all \(p<1/6\) [2104.00826]. This nonlinear theory shows that the classical Favard length problem is part of a broader projection program in which orthogonal projections, curve projections, visibility, and surface probes are handled by a common transversality-and-energy mechanism. ## 6. Random models, higher dimensions, and extremal problems Random models often exhibit much sharper decay than deterministic self-similar sets. "The exact Power Law for Buffon's needle landing near some Random Cantor Sets" proves that for random \(4\)-adic disk Cantor sets generated by independent random rotations, \[ \mathbb{E}_\omega[\operatorname{Fav}(\mathcal{D}_n(\omega))]\le \frac{C}{n}, \] and similarly for random \(d\)-adic models with \(d\ge 3\). Together with Mattila’s lower bound, this gives the exact \(n^{-1}\) decay rate in the average sense [1801.06904]. "The Buffon's needle problem for random planar disk-like Cantor sets" proves the same order \[ \operatorname{Fav}(K_\delta)\sim \frac{c}{\log(1/\delta)} \] for a third random disk model, matching the lower bound and reinforcing the observation that several distinct randomization schemes yield the same logarithmic law [2205.14559]. More recent work shows that this law is neither accidental nor universal. "Sharp Favard length of random Cantor sets" proves that for a large class of planar \(1\)-dimensional random fractals \(S\), \[ \operatorname{Fav}(S(r))\asymp \frac{1}{\log(1/r)}, \] with almost sure asymptotics and an explicit limiting constant for wide classes of grid random fractals. The same paper also constructs \(1\)-dimensional Ahlfors-regular random fractals for which \[ \operatorname{Fav}(S(r))\sim \frac{\log\log(1/r)}{\log(1/r)}, \] showing that \(1/\log(1/r)\) is not universal even among random Ahlfors-regular sets [2512.17753]. The scope of the problem has also expanded to higher dimensions. "Power Laws for the Favard Length Problem in \(\mathbb{R}^d\)" proves power-law upper bounds for neighborhoods of higher-dimensional analogues of the four-corner Cantor set and for broader rational digit constructions. For the \(2^d\)-corner Cantor set \(\mathcal{K}_d^\infty\subset \mathbb{R}^d\), \[ C^{-1}N^{-1}\le \operatorname{Fav}\!\left(\mathcal{N}_{2^{-dN}}(\mathcal{K}_d^\infty)\right)\le C N^{-\epsilon}, \] and for \(d\ge 3\) this is stated to be the first non-trivial asymptotic upper bound for the Favard length problem in that setting [2509.02882]. A separate extremal direction treats Favard length as a variational functional. "The isoperimetric problem for the Favard length" shows that among planar Borel sets of fixed area, a circle minimizes Favard length. For the unit-area disk, \[ \operatorname{Fav}(E)=2\sqrt{\pi}, \] and more generally \[ \frac{\operatorname{Fav}(E)}{\sqrt{|E|}}\ge 2\sqrt{\pi}, \] with equality only for circles in the stated sense [2606.10608]. Together with the near-maximizer theory for sets of fixed length, this places Favard length within a broader extremal geometry. The contemporary Favard length problem is therefore no longer a single decay estimate for one Cantor set. It is a network of quantitative questions about projection size, arithmetic self-similarity, rectifiability, randomness, nonlinear probing, and extremal geometry. The deterministic planar four-corner problem remains the emblematic test case, but the surrounding theory now reaches from cyclotomic divisibility to analytic capacity and from Ahlfors-regular quantitative rectifiability to higher-dimensional self-similar constructions. Source: https://www.emergentmind.com/topics/favard-length-problem