2000 character limit reached
Favard length and quantitative rectifiability
Published 7 Aug 2024 in math.CA and math.MG | (2408.03919v1)
Abstract: The Favard length of a Borel set $E\subset\mathbb{R}2$ is the average length of its orthogonal projections. We prove that if $E$ is Ahlfors 1-regular and it has large Favard length, then it contains a big piece of a Lipschitz graph. This gives a quantitative version of the Besicovitch projection theorem. As a corollary, we answer questions of David and Semmes and of Peres and Solomyak. We also make progress on Vitushkin's conjecture.
Paper 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.