New Bounds on the Dimensions of Planar Distance Sets

By Tamás Keleti, Pablo Shmerkin. Geometric and Functional Analysis, 2018

48 citations recorded by the source corpus.

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\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$A\subset {\mathbb {R}}^2$$\end{document} is a Borel set of Hausdorff dimension s>1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s>1$$\end{document}, then its distance set has Hausdorff dimension at least 37/54≈0.685\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$37/54\approx 0.685$$\end{document}. Moreover, if s∈(1,3/2]\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s\in (1,3/2]$$\end{document}, then outside of a set of exceptional y of Hausdorff dimension at most 1, the pinned distance set {|x-y|:x∈A}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{ |x-y|:x\in A\}$$\end{document} has Hausdorff dimension ≥23s\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ge \tfrac{2}{3}s$$\end{document} and packing dimension at least 14(1+s+3s(2-s))≥0.933\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \tfrac{1}{4}(1+s+\sqrt{3s(2-s)}) \ge 0.933$$\end{document}. These estimates improve upon the existing ones by Bourgain, Wolff, Peres–Schlag and Iosevich–Liu for sets of Hausdorff dimension >1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$>1$$\end{document}. 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.

Subfields: Discrete Mathematics and Combinatorics, Mathematical Physics, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/cff9d1530d82dd3dcf64cb8db63d31d951eed755

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

  1. Hong Wang
  2. Larry Guth
  3. Noam Solomon
  4. Jonathan M. Fraser
  5. Pablo Shmerkin
  6. Yumeng Ou
  7. Tuomas Orponen
  8. Alex Iosevich

In Mathematical Physics

  1. Ruixiang Zhang
  2. Hong Wang
  3. Xiumin Du
  4. Larry Guth
  5. Yumeng Ou
  6. Jonathan M. Fraser
  7. Pablo Shmerkin
  8. Noam Solomon

In Numerical Analysis

  1. Hong Wang
  2. Larry Guth
  3. Noam Solomon
  4. Jonathan M. Fraser
  5. Yumeng Ou
  6. Alex Iosevich
  7. Tuomas Orponen
  8. Ruixiang Zhang

Citations in the corpus