Bounding the Dimension of Points on a Line
Preprint
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.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Mutual DimensionACM Transactions on Computation Theory, 2015
- Dimension spectra of random subfractals of self-similar fractalsAnnals of Pure and Applied Logic, 2014
- Translating the Cantor set by a random realTransactions of the American Mathematical Society, 2014
- Furstenberg sets for a fractal set of directionsProceedings of the American Mathematical Society, 2011
- Connectedness properties of dimension level setsTheoretical Computer Science, 2011
- Correspondence Principles for Effective DimensionsTheory of Computing Systems, 2004
- A Kolmogorov complexity characterization of constructive Hausdorff dimensionInformation Processing Letters, 2002
- Some remarks on the Kakeya problemMathematical Proceedings of the Cambridge Philosophical Society, 1971