New bounds on the dimensions of planar distance sets

We prove new bounds on the dimensions of distance sets and pinned distance sets of planar sets. Among other results, we show that if A ⊂ R2 is a Borel set of Hausdorff dimension s > 1, then its distance set has Hausdorff dimension at least 37/54 ≈ 0.685. Moreover, if s ∈ (1, 3/2], then outside of...

Descripción completa

Detalles Bibliográficos
Autores: Keleti, Tamas, Shmerkin, Pablo Sebastian
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2019
País:Argentina
Institución:Consejo Nacional de Investigaciones Científicas y Técnicas
Repositorio:CONICET Digital (CONICET)
Idioma:inglés
OAI Identifier:oai:ri.conicet.gov.ar:11336/135439
Acceso en línea:http://hdl.handle.net/11336/135439
Access Level:acceso abierto
Palabra clave:DISTANCE SETS
FALCONER’S PROBLEM
HAUSDORFF DIMENSION
LIPSCHITZ FUNCTIONS
PACKING DIMENSION
PINNED DISTANCE SETS
https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
Descripción
Sumario:We prove new bounds on the dimensions of distance sets and pinned distance sets of planar sets. Among other results, we show that if A ⊂ R2 is a Borel set of Hausdorff dimension s > 1, then its distance set has Hausdorff dimension at least 37/54 ≈ 0.685. Moreover, if s ∈ (1, 3/2], then outside of a set of exceptional y of Hausdorff dimension at most 1, the pinned distance set {|x − y| : x ∈ A} has Hausdorff dimension ≥ 2 3 s and packing dimension at least 1 4 (1+s+3s(2 − s)) ≥ 0.933. These estimates improve upon the existing ones by Bourgain, Wolff, Peres–Schlag and Iosevich–Liu for sets of Hausdorff dimension > 1. Our proof uses a multi-scale decomposition of measures in which, unlike previous works, we are able to choose the scales subject to certain constrains. This leads to a combinatorial problem, which is a key new ingredient of our approach, and which we solve completely by optimizing certain variation of Lipschitz functions.