Abstract
Algorithmic fractal dimensions quantify the algorithmic information density of individual points and may be defined in terms of Kolmogorov complexity. This work uses these dimensions to bound the classical Hausdorff and packing dimensions of intersections and Cartesian products of fractals in Euclidean spaces. This approach shows that two prominent, fundamental results about the dimension of Borel or analytic sets also hold for arbitrary sets.
- K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. 2007. Effective strong dimension in algorithmic information and computational complexity. SIAM Journal of Computing 37, 3 (2007), 671–705. Google Scholar
Digital Library
- V. Becher, J. Reimann, and T. A. Slaman. 2018. Irrationality exponent, Hausdorff dimension and effectivization. Monatshefte für Mathematik 185, 2 (2018), 167–188.Google Scholar
Cross Ref
- Bishop, C. J. 2017. Personal communication. April 27.Google Scholar
- C. J. Bishop and Y. Peres. 1996. Packing dimension and Cartesian products. Transactions of the American Mathematical Society 348 (1996), 4433–4445.Google Scholar
Cross Ref
- C. J. Bishop and Y. Peres. 2016. Fractals in Probability and Analysis. Cambridge Studies in Advanced Mathematics. Cambridge University Press.Google Scholar
- J. Cai and J. Hartmanis. 1994. On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line. Journal of Computer and System Sciences 49, 3 (1994), 605–619. Google Scholar
Digital Library
- A. Case and J. H. Lutz. 2015. Mutual dimension. ACM Transactions on Computation Theory 7, 3 (2015), 12. Google Scholar
Digital Library
- R. O. Davies. 1971. Some remarks on the Kakeya problem. Proceedings of the Cambridge Philosophical Society 69 (1971), 417–421.Google Scholar
Cross Ref
- K. J. Falconer. 1985. The Geometry of Fractal Sets. Cambridge University Press. Google Scholar
Digital Library
- K. J. Falconer. 1994. Sets with large intersection properties. Journal of the London Mathematical Society 49, 2 (1994), 267–280.Google Scholar
Cross Ref
- K. J. Falconer. 2014. Fractal Geometry: Mathematical Foundations and Applications (3rd ed.). Wiley.Google Scholar
- F. Hausdorff. 1919. Dimension und äusseres Mass. Mathematische Annalen 79 (1919), 157–179.Google Scholar
Cross Ref
- J.-P. Kahane. 1986. Sur la dimension des intersections. In Aspects of Mathematics and Its Applications, J. A. Barroso (Ed.). North-Holland Mathematical Library, 34. Elsevier, 419–430.Google Scholar
- M. Li and P. M. Vitányi. 2008. An Introduction to Kolmogorov Complexity and Its Applications (3rd ed.). Springer. Google Scholar
Digital Library
- J. H. Lutz. 2003. The dimensions of individual strings and sequences. Information and Computation 187, 1 (2003), 49–79. Google Scholar
Digital Library
- J. H. Lutz and N. Lutz. 2018. Algorithmic information, plane Kakeya sets, and conditional dimension. ACM Transactions on Computation Theory 10, 2, Article 7 (2018), 22 pages. Google Scholar
Digital Library
- J. H. Lutz and E. Mayordomo. 2008. Dimensions of points in self-similar fractals. SIAM Journal of Computing 38, 3 (2008), 1080–1112. Google Scholar
Digital Library
- N. Lutz and D. M. Stull. 2020. Bounding the dimension of points on a line. Information and Computation 275 (2020), 104601.Google Scholar
Cross Ref
- J. M. Marstrand. 1954. Some fundamental geometrical properties of plane sets of fractional dimensions. Proceedings of the London Mathematical Society 4, 3 (1954), 257–302.Google Scholar
Cross Ref
- P. Martin-Löf. 1966. The definition of random sequences. Information and Control 9, 6 (1966), 602–619.Google Scholar
Cross Ref
- P. Mattila. 1984. Hausdorff dimension and capacities of intersections of sets in -space. Acta Mathematica 152 (1984), 77–105.Google Scholar
Cross Ref
- P. Mattila. 1985. On the Hausdorff dimension and capacities of intersections. Mathematika 32 (1985), 213–217.Google Scholar
Cross Ref
- P. Mattila. 1995. Geometry of Sets and Measures in Euclidean Spaces: Fractals and Rectifiability. Cambridge University Press.Google Scholar
- E. Mayordomo. 2002. A Kolmogorov complexity characterization of constructive Hausdorff dimension. Information Processing Letters 84, 1 (2002), 1–3. Google Scholar
Digital Library
- E. Mayordomo. 2008. Effective fractal dimension in algorithmic information theory. In New Computational Paradigms: Changing Conceptions of What Is Computable, S. B. Cooper, B. Löwe, and A. Sorbi (Eds.). Springer, New York, NY, 259–285.Google Scholar
- U. Molter and E. Rela. 2012. Furstenberg sets for a fractal set of directions. Proceedings of the American Mathematical Society 140 (2012), 2753–2765.Google Scholar
Cross Ref
- J. Reimann. 2004. Computability and fractal dimension. Ph.D. Thesis, Heidelberg University.Google Scholar
- J. Reimann. 2008. Effectively closed sets of measures and randomness. Annals of Pure and Applied Logic 156, 1 (2008), 170–182.Google Scholar
Cross Ref
- B. Ryabko. 1984. Coding of combinatorial sources and Hausdorff dimension. Soviets Mathematics Doklady 30 (1984), 219–222.Google Scholar
- B. Ryabko. 1986. Noiseless coding of combinatorial sources. Problems of Information Transmission 22 (1986), 170–179.Google Scholar
- B. Ryabko. 1993. Algorithmic approach to the prediction problem. Problems of Information Transmission 29 (1993), 186–193.Google Scholar
- B. Ryabko. 1994. The complexity and effectiveness of prediction algorithms. Journal of Complexity 10, 3 (1994), 281–295. Google Scholar
Digital Library
- L. Staiger. 1989. Kolmogorov complexity and Hausdorff dimension. Information and Computation 103 (1989), 159–194. Google Scholar
Digital Library
- L. Staiger. 1998. A tight upper bound on Kolmogorov complexity and uniformly optimal prediction. Theory of Computing Systems 31 (1998), 215–229.Google Scholar
Cross Ref
- E. M. Stein and R. Shakarchi. 2005. Real Analysis: Measure Theory, Integration, and Hilbert Spaces. Princeton Lectures in Analysis. Princeton University Press.Google Scholar
Cross Ref
- D. Sullivan. 1984. Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups. Acta Mathematica 153, 1 (1984), 259–277.Google Scholar
Cross Ref
- C. Tricot. 1982. Two definitions of fractional dimension. Mathematical Proceedings of the Cambridge Philosophical Society 91, 1 (1982), 57–74.Google Scholar
Cross Ref
- A. K. Zvonkin and L. A. Levin. 1970. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematical Surveys 25 (1970), 83–124.Google Scholar
Cross Ref
Index Terms
Fractal Intersections and Products via Algorithmic Dimension
Recommendations
Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
We formulate the conditional Kolmogorov complexity of x given y at precision r, where x and y are points in Euclidean spaces and r is a natural number. We demonstrate the utility of this notion in two ways;
(1) We prove a point-to-set principle that ...
Effective Hausdorff Dimension in General Metric Spaces
We introduce the concept of effective dimension for a wide class of metric spaces whose metric is not necessarily based on a measure. Effective dimension was defined by Lutz (Inf. Comput., 187(1), 49---79, 2003) for Cantor space and has also been ...
Effective Strong Dimension in Algorithmic Information and Computational Complexity
The two most important notions of fractal dimension are Hausdorff dimension, developed by Hausdorff [Math. Ann., 79 (1919), pp. 157-179], and packing dimension, developed independently by Tricot [Math. Proc. Cambridge Philos. Soc., 91 (1982), pp. 57-74] ...






Comments