Dimension of Pinned Distance Sets for Semi-Regular Sets
Jacob B. Fiedler, D. M. Stull

TL;DR
This paper establishes new lower bounds for the Hausdorff and packing dimensions of pinned distance sets for semi-regular sets in the plane, advancing understanding of distance set problems in geometric measure theory.
Contribution
It provides the best known lower bounds for the Hausdorff dimension of pinned distance sets when the dimension is between 1 and approximately 1.686, and explores conditions for full dimension in related settings.
Findings
Lower bound for Hausdorff dimension of pinned distance sets when d in (1, 5−√15)
Existence of points with pinned distance set of large packing dimension
Conditions under which pinned distance sets have full Hausdorff dimension
Abstract
We prove that if is analytic and , there are ``many'' points such that the Hausdorff dimension of the pinned distance set is at least , where . In particular, we prove that for these , which gives the best known lower bound for this problem when . We also prove that there exists some such that the packing dimension of is at least . Moreover, whenever the packing dimension of is sufficiently close to the Hausdorff dimension of , we show the pinned distance set has full Hausdorff dimension for many points ; in particular the condition is that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Advanced Topology and Set Theory · Limits and Structures in Graph Theory
