Structure of sets with nearly maximal Favard length

Abstract: Let

E s u b s e t B (1) s u b s e t m a t h b b R^{2}

be an

m a t h c a l H^{1}

measurable set with

m a t h c a l H^{1} (E) < i n f t y

, and let

L s u b s e t m a t h b b R^{2}

be a line segment with

m a t h c a l H^{1} (L) = m a t h c a l H^{1} (E)

. It is not hard to see that

m a t h r m F a v (E) l e q m a t h r m F a v (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

e p s i l o n

-Lipschitz graph, up to a set of length

e p s i l o n

. The dependence between

e p s i l o n

and

d e l t a

is polynomial: in fact, the conclusions hold with

e p s i l o n = C d e l t a^{1 / 70}

for an absolute constant

C > 0

.

Cited in

(4)

This page was built for publication: Structure of sets with nearly maximal Favard length