Currently displaying 1 – 9 of 9

Showing per page

Order by Relevance | Title | Year of publication

Checkerboards, Lipschitz functions and uniform rectifiability.

Peter W. JonesNets Hawk KatzAna Vargas — 1997

Revista Matemática Iberoamericana

In his recent lecture at the International Congress [S], Stephen Semmes stated the following conjecture for which we provide a proof. Theorem. Suppose Ω is a bounded open set in Rn with n > 2, and suppose that B(0,1) ⊂ Ω, Hn-1(∂Ω) = M < ∞ (depending on n and M) and a Lipschitz graph Γ (with constant L) such that Hn-1(Γ ∩ ∂Ω) ≥ ε. Here Hk...

Page 1

Download Results (CSV)