Structure of sets with nearly maximal Favard length
Classical Analysis and ODEs
2024-05-22 v1 Metric Geometry
Abstract
Let be an measurable set with , and let be a line segment with . It is not hard to see that . We prove that in the case of near equality, that is, the set 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 for an absolute constant .
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