Dimension of Pinned Distance Sets for Semi-Regular Sets
Abstract
We prove that if E⊂eq 2 is analytic and 1<d < H(E), there are ``many'' points x∈ E such that the Hausdorff dimension of the pinned distance set x E is at least d(1 - (D-1)(D-d)2D2+(2-4d)D+d2+d-2), where D = P(E). In particular, we prove that H(x E) ≥ d(d-4)d-5 for these x, which gives the best known lower bound for this problem when d ∈ (1, 5-15). We also prove that there exists some x∈ E such that the packing dimension of x E is at least 12 -282. Moreover, whenever the packing dimension of E is sufficiently close to the Hausdorff dimension of E, we show the pinned distance set x E has full Hausdorff dimension for many points x∈ E; in particular the condition is that D<(3+5)d-1-52. We also consider the pinned distance problem between two sets X, Y⊂eq 2, both of Hausdorff dimension greater than 1. We show that if either X or Y has equal Hausdorff and packing dimensions, the pinned distance x Y has full Hausdorff dimension for many points x∈ X.
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.