Pinned Distance Sets Using Effective Dimension

arXiv2207.12501MaRDI QIDQ6406022FDOQ6406022

Authors: D. M. Stull 

Publication date: 25 July 2022

Abstract: In this paper, we use algorithmic tools, effective dimension and Kolmogorov complexity, to study the fractal dimension of distance sets. We show that, for any analytic set $Esubseteq{R}^2$ of Hausdorff dimension strictly greater than one, the extit{pinned distance set} of $E$, $Delt{a}_{x}E$, has Hausdorff dimension of at least $frac34$, for all points $x$ outside a set of Hausdorff dimension at most one. This improves the best known bounds when the dimension of $E$ is close to one.

This page was built for publication: Pinned Distance Sets Using Effective Dimension

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6406022)