English

Structure of sets with nearly maximal Favard length

Classical Analysis and ODEs 2024-05-22 v1 Metric Geometry

Abstract

Let EB(1)R2E \subset B(1) \subset \mathbb R^{2} be an H1\mathcal{H}^{1} measurable set with H1(E)<\mathcal{H}^{1}(E) < \infty, and let LR2L \subset \mathbb R^{2} be a line segment with H1(L)=H1(E)\mathcal{H}^{1}(L) = \mathcal{H}^{1}(E). It is not hard to see that Fav(E)Fav(L)\mathrm{Fav}(E) \leq \mathrm{Fav}(L). We prove that in the case of near equality, that is, Fav(E)Fav(L)δ, \mathrm{Fav}(E) \geq \mathrm{Fav}(L) - \delta, the set EE can be covered by an ϵ\epsilon-Lipschitz graph, up to a set of length ϵ\epsilon. The dependence between ϵ\epsilon and δ\delta is polynomial: in fact, the conclusions hold with ϵ=Cδ1/70\epsilon = C\delta^{1/70} for an absolute constant C>0C > 0.

Keywords

Cite

@article{arxiv.2203.01279,
  title  = {Structure of sets with nearly maximal Favard length},
  author = {Alan Chang and Damian Dąbrowski and Tuomas Orponen and Michele Villa},
  journal= {arXiv preprint arXiv:2203.01279},
  year   = {2024}
}

Comments

25 pages, 4 figures