Bounding the Dimension of Points on a Line
classification
💻 cs.CC
math.CA
keywords
dimensionboundhausdorfflowerapplyboundingclassicalcomplexity
read the original abstract
We use Kolmogorov complexity methods to give a lower bound on the effective Hausdorff dimension of the point (x, ax+b), given real numbers a, b, and x. We apply our main theorem to a problem in fractal geometry, giving an improved lower bound on the (classical) Hausdorff dimension of generalized sets of Furstenberg type.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.