Papers
Topics
Authors
Recent
Search
2000 character limit reached

Structure of sets with nearly maximal Favard length

Published 2 Mar 2022 in math.CA and math.MG | (2203.01279v1)

Abstract: Let $E \subset B(1) \subset \mathbb R{2}$ be an $\mathcal{H}{1}$ measurable set with $\mathcal{H}{1}(E) < \infty$, and let $L \subset \mathbb R{2}$ be a line segment with $\mathcal{H}{1}(L) = \mathcal{H}{1}(E)$. It is not hard to see that $\mathrm{Fav}(E) \leq \mathrm{Fav}(L)$. We prove that in the case of near equality, that is, $$ \mathrm{Fav}(E) \geq \mathrm{Fav}(L) - \delta, $$ the set $E$ 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 $\epsilon = C\delta{1/70}$ for an absolute constant $C > 0$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.