On the distance sets of Ahlfors–David regular sets

By Tuomas Orponen. 2015

49 citations recorded by the source corpus.

Abstract I prove that if ∅ ≠ K ⊂ R 2 is a compact s-Ahlfors–David regular set with s ≥ 1 , then dim p ⁡ D ( K ) = 1 , where D ( K ) : = { | x − y | : x , y ∈ K } is the distance set of K, and dim p stands for packing dimension. The same proof strategy applies to other problems of similar nature. For instance, one can show that if ∅ ≠ K ⊂ R 2 is a compact s-Ahlfors–David regular set with s ≥ 1 , then there exists a point x 0 ∈ K such that dim p ⁡ K ⋅ ( K − x 0 ) = 1 .

Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/9480267d4f82e1a0c83e6b57d1feb8c2431f3a21

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. Larry Guth
  2. Hong Wang
  3. Pablo Shmerkin
  4. Noam Solomon
  5. Jonathan M. Fraser
  6. Yumeng Ou
  7. Tamás Keleti

In Geometry and Topology

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

In Mathematical Physics

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

Citations in the corpus