undefined

Structure of sets with nearly maximal Favard length

Year of publication

2024

Authors

Chang, A. lan; Dąbrowski, Damian; Orponen, Tuomas; Villa, Michele

Abstract

Let E⊂B(1)⊂R2 be an H1 measurable set with H1(E)<∞, and let L⊂R2 be a line segment with H1(L)=H1(E). It is not hard to see that Fav(E)≤Fav(L). We prove that in the case of near equality, that is, Fav(E)≥Fav(L)−δ, the set E 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 ϵ=Cδ1∕70 for an absolute constant C>0.
Show more

Organizations and authors

University of Jyväskylä

Dabrowski Damian Orcid -palvelun logo

Orponen Tuomas Orcid -palvelun logo

University of Oulu

Villa Michele

Publication type

Publication format

Article

Parent publication type

Journal

Article type

Original article

Audience

Scientific

Peer-reviewed

Peer-Reviewed

MINEDU's publication type classification code

A1 Journal article (refereed), original research

Publication channel information

Journal/Series

Analysis and pde

Volume

17

Issue

4

Pages

1473-1500

​Publication forum

51059

​Publication forum level

3

Open access

Open access in the publisher’s service

Yes

Open access of publication channel

Partially open publication channel

Self-archived

Yes

Other information

Fields of science

Mathematics

Keywords

[object Object],[object Object],[object Object],[object Object]

Publication country

United States

Internationality of the publisher

International

Language

English

International co-publication

Yes

Co-publication with a company

No

DOI

10.2140/apde.2024.17.1473

The publication is included in the Ministry of Education and Culture’s Publication data collection

Yes