On the distance sets of AD-regular sets

Abstract

I prove that if ≠ K ⊂ R2 is a compact s-Ahlfors-David regular set with s ≥ 1, then p D(K) = 1, where D(K) := \|x - y| : x,y ∈ K\ is the distance set of K, and p stands for packing dimension. The same proof strategy applies to other problems of similar nature. For instance, one can show that if ≠ K ⊂ R2 is a compact s-Ahlfors-David regular set with s ≥ 1, then there exists a point x0 ∈ K such that p K · (K - x0) = 1. Specialising to product sets, one derives the following sum-product corollary: if A ⊂ R is a non-empty compact s-Ahlfors-David regular set with s ≥ 1/2, then p [A(A - a1) + A(A - a1)] = 1 for some a1,a2 ∈ A. In particular, p [AA + AA - AA - AA] = 1. In all of the results mentioned above, compactness can be relaxed to boundedness and Hs-measurability, if packing dimension is replaced by upper box dimension.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…