New bounds on the dimensions of planar distance sets
Abstract
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 23s and packing dimension at least 14(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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.