Structure of sets with nearly maximal Favard length

Abstract

Let E ⊂ B(1) ⊂ R2 be an H1 measurable set with H1(E) < ∞, and let L ⊂ R2 be a line segment with H1(L) = H1(E). It is not hard to see that Fav(E) ≤ Fav(L). We prove that in the case of near equality, that is, Fav(E) ≥ Fav(L) - δ, the set E can be covered by an ε-Lipschitz graph, up to a set of length ε. The dependence between ε and δ is polynomial: in fact, the conclusions hold with ε = Cδ1/70 for an absolute constant C > 0.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…