English

On distance sets, box-counting and Ahlfors-regular sets

Classical Analysis and ODEs 2017-05-23 v3 Combinatorics Dynamical Systems

Abstract

We obtain box-counting estimates for the pinned distance sets of (dense subsets of) planar discrete Ahlfors-regular sets of exponent s>1s>1. As a corollary, we improve upon a recent result of Orponen, by showing that if AA is Ahlfors-regular of dimension s>1s>1, then almost all pinned distance sets of AA have lower box-counting dimension 11. We also show that if A,BR2A,B\subset\mathbb{R}^2 have Hausdorff dimension >1>1 and AA is Ahlfors-regular, then the set of distances between AA and BB has modified lower box-counting dimension 11, which taking B=AB=A improves Orponen's result in a different direction, by lowering packing dimension to modified lower box-counting dimension. The proofs involve ergodic-theoretic ideas, relying on the theory of CP-processes and projections.

Keywords

Cite

@article{arxiv.1605.00187,
  title  = {On distance sets, box-counting and Ahlfors-regular sets},
  author = {Pablo Shmerkin},
  journal= {arXiv preprint arXiv:1605.00187},
  year   = {2017}
}

Comments

22 pages, no figures. v2: added Corollary 1.5 on box dimension of pinned distance sets. v3: numerous fixes and clarifications based on referee reports

R2 v1 2026-06-22T13:45:33.384Z