2026-07-20T14:48:21Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8087 2024-03-06T10:40:56Z ddc:004 open_access

Fractal Intersections and Products via Algorithmic Dimension Lutz, Neil algorithmic randomness geometric measure theory Hausdorff dimension Kolmogorov complexity 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Neil Lutz 2017 Is Part Of LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2017.58 urn:nbn:de:0030-drops-80875 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.58 eng https://creativecommons.org/licenses/by/3.0/legalcode