Document Open Access Logo

Fractal Intersections and Products via Algorithmic Dimension

Author Neil Lutz

Thumbnail PDF


  • Filesize: 0.49 MB
  • 12 pages

Document Identifiers

Author Details

Neil Lutz

Cite AsGet BibTex

Neil Lutz. Fractal Intersections and Products via Algorithmic Dimension. In 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 83, pp. 58:1-58:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)


Algorithmic 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 a known intersection formula for Borel sets holds for arbitrary sets, and it significantly simplifies the proof of a known product formula. Both of these formulas are prominent, fundamental results in fractal geometry that are taught in typical undergraduate courses on the subject.
  • algorithmic randomness
  • geometric measure theory
  • Hausdorff dimension
  • Kolmogorov complexity


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Krishna B. Athreya, John M. Hitchcock, Jack H. Lutz, and Elvira Mayordomo. Effective strong dimension in algorithmic information and computational complexity. SIAM Journal of Computing, 37(3):671-705, 2007. URL:
  2. Verónica Becher, Jan Reimann, and Theodore A. Slaman. Irrationality exponent, Hausdorff dimension and effectivization. arXiv:1601.00153 [math.NT], 2016. Google Scholar
  3. Christopher J. Bishop. Personal communication, April 27, 2017. Google Scholar
  4. Christopher J. Bishop and Yuval Peres. Fractals in Probability and Analysis. Cambridge University Press, 2017. URL:
  5. Jin-Yi Cai and Juris Hartmanis. On Hausdorff and topological dimensions of the Kolmogorov complexity of the real line. Journal of Computer and System Sciences, 49(3):605-619, 1994. URL:
  6. Adam Case and Jack H. Lutz. Mutual dimension. ACM Transactions on Computation Theory, 7(3):12, 2015. URL:
  7. R. O. Davies. Some remarks on the Kakeya problem. Proceedings of the Cambridge Philosophical Society, 69:417-421, 1971. URL:
  8. Rod Downey and Denis Hirschfeldt. Algorithmic Randomness and Complexity. Springer-Verlag, 2010. URL:
  9. Kenneth J. Falconer. The Geometry of Fractal Sets. Cambridge University Press, 1985. URL:
  10. Kenneth J. Falconer. Sets with large intersection properties. Journal of the London Mathematical Society, 49(2):267-280, 1994. URL:
  11. Kenneth J. Falconer. Fractal Geometry: Mathematical Foundations and Applications. Wiley, third edition, 2014. URL:
  12. Felix Hausdorff. Dimension und äusseres Mass. Mathematische Annalen, 79:157-179, 1919. URL:
  13. Jean-Pierre Kahane. Sur la dimension des intersections. In Jorge Alberto Barroso, editor, Aspects of mathematics and its applications, North-Holland Mathematical Library, 34, pages 419-430. Elsevier, 1986. URL:
  14. Ming Li and Paul M.B. Vitányi. An Introduction to Kolmogorov Complexity and Its Applications. Springer, third edition, 2008. URL:
  15. Jack H. Lutz. The dimensions of individual strings and sequences. Information and Computation, 187(1):49-79, 2003. URL:
  16. Jack H. Lutz and Neil Lutz. Algorithmic information, plane Kakeya sets, and conditional dimension. In Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pages 53:1-53:13, 2017. URL:
  17. Jack H. Lutz and Elvira Mayordomo. Dimensions of points in self-similar fractals. SIAM Journal of Computing, 38(3):1080-1112, 2008. URL:
  18. Neil Lutz and D. M. Stull. Bounding the dimension of points on a line. In TV Gopal, Gerhard Jaeger, and Silvia Steila, editors, Theory and Applications of Models of Computation: 14th Annual Conference, TAMC 2017, Bern, Switzerland, April 20-22, 2017, Proceedings, pages 425-439, 2017. URL:
  19. John M. Marstrand. Some fundamental geometrical properties of plane sets of fractional dimensions. Proceedings of the London Mathematical Society, 4(3):257-302, 1954. URL:
  20. Per Martin-Löf. The definition of random sequences. Information and Control, 9(6):602-619, 1966. URL:
  21. Pertti Mattila. Hausdorff dimension and capacities of intersections of sets in n-space. Acta Mathematica, 152:77-105, 1984. URL:
  22. Pertti Mattila. On the Hausdorff dimension and capacities of intersections. Mathematika, 32:213-217, 1985. URL:
  23. Pertti Mattila. Geometry of sets and measures in Euclidean spaces: fractals and rectifiability. Cambridge University Press, 1995. URL:
  24. Elvira Mayordomo. A Kolmogorov complexity characterization of constructive Hausdorff dimension. Inf. Process. Lett., 84(1):1-3, 2002. URL:
  25. Elvira Mayordomo. Effective fractal dimension in algorithmic information theory. In S. Barry Cooper, Benedikt Löwe, and Andrea Sorbi, editors, New Computational Paradigms: Changing Conceptions of What is Computable, pages 259-285. Springer New York, 2008. URL:
  26. Ursula Molter and Ezequiel Rela. Furstenberg sets for a fractal set of directions. Proceedings of the American Mathematical Society, 140:2753-2765, 2012. URL:
  27. Andre Nies. Computability and Randomness. Oxford University Press, Inc., New York, NY, USA, 2009. URL:
  28. Jan Reimann. Computability and fractal dimension. PhD thesis, Heidelberg University, 2004. Google Scholar
  29. Jan Reimann. Effectively closed sets of measures and randomness. Annals of Pure and Applied Logic, 156(1):170-182, 2008. URL:
  30. Boris Ryabko. Noiseless coding of combinatorial sources. Problems of Information Transmission, 22:170-179, 1986. Google Scholar
  31. Boris Ryabko. Algorithmic approach to the prediction problem. Problems of Information Transmission, 29:186-193, 1993. Google Scholar
  32. Boris Ryabko. The complexity and effectiveness of prediction algorithms. Journal of Complexity, 10(3):281-295, 1994. URL:
  33. Ludwig Staiger. Kolmogorov complexity and Hausdorff dimension. Information and Computation, 103:159-194, 1989. URL:
  34. Ludwig Staiger. A tight upper bound on Kolmogorov complexity and uniformly optimal prediction. Theory of Computing Systems, 31:215-229, 1998. URL:
  35. Elias M. Stein and Rami Shakarchi. Real Analysis: Measure Theory, Integration, and Hilbert Spaces. Princeton Lectures in Analysis. Princeton University Press, 2005. Google Scholar
  36. Dennis Sullivan. Entropy, Hausdorff measures old and new, and limit sets of geometrically finite Kleinian groups. Acta Mathematica, 153(1):259-277, 1984. URL:
  37. Claude Tricot. Two definitions of fractional dimension. Mathematical Proceedings of the Cambridge Philosophical Society, 91(1):57-74, 1982. URL:
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail