Hostname: page-component-cb9f654ff-9b74x Total loading time: 0 Render date: 2025-08-24T16:44:01.462Z Has data issue: false hasContentIssue false
  • English
  • Français

Dimension approximation of attractors of graph directed IFSs by self-similar sets

Published online by Cambridge University Press:  31 August 2018

ÁBEL FARKAS
ÁBEL FARKAS*
Affiliation:
Einstein Institute of Mathematics, Edmond J. Safra Campus, The Hebrew University of Jerusalem, Givat Ram, Jerusalem, 9190401Israel. e-mail: thesecondabel@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We show that for the attractor (K1, . . ., Kq) of a graph directed iterated function system, for each 1 ⩽ j ⩽ q and ϵ > 0 there exists a self-similar set K ⊆ Kj that satisfies the strong separation condition and dimHKj − ϵ < dimHK. We show that we can further assume convenient conditions on the orthogonal parts and similarity ratios of the defining similarities of K. Using this property as a ‘black box’ we obtain results on a range of topics including on dimensions of projections, intersections, distance sets and sums and products of sets.

Information

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 167 , Issue 1 , July 2019 , pp. 193 - 207
Copyright
Copyright © Cambridge Philosophical Society 2018 

References

REFERENCES

[1] Bárány, B. On some non-linear projections of self-similar sets in ℝ3. Fund. Math. 237 (2017), 83–100.Google Scholar
[2] Falconer, K. J. On the Hausdorff dimensions of distance sets. Mathematika 32 (1985), 206–212.Google Scholar
[3] Falconer, K. Fractal Geometry, third edition (John Wiley & Sons, Ltd., Chichester, 2014).Google Scholar
[4] Falconer, K. Techniques in Fractal Geometry (John Wiley & Sons, Ltd., Chichester, 1997).Google Scholar
[5] Falconer, K. and Jin, X. Dimension conservation for self-similar sets and fractal percolation. Int. Math. Res. Not. 24 (2015), 13260–13289.Google Scholar
[6] Farkas, A. Projections of self-similar sets with no separation condition. Israel J. Math. 214 (2016), 67–107.Google Scholar
[7] Farkas, A. and Fraser, J. M. On the equality of Hausdorff measure and Hausdorff content. J. Fractal Geometry. 2 (2015), 403-429.Google Scholar
[8] Fraser, J. M. and Pollicott, M. Micromeasure distributions and applications for conformally generated fractals. Math. Proc. Camb. Phil. Soc. 159 (2015), 547–566.Google Scholar
[9] Furstenberg, H. Ergodic fractal measures and dimension conservation. Ergodic Theory Dynam. Systems 28 (2008), 405–422. MR2408385 (2009e:28032)Google Scholar
[10] Hochman, M. and Shmerkin, P. Local entropy averages and projections of fractal measures. Ann. Math. (2) 175 (2012), 1001–1059. MR2912701Google Scholar
[11] Hutchinson, J. E. Fractals and self-similarity. Indiana Univ. Math. J. 30 (1981), 713–747.Google Scholar
[12] Mattila, P. Geometry of Sets and Measures in Euclidean Spaces (Cambridge University Press, Cambridge, 1995).Google Scholar
[13] Mauldin, R. D. and Williams, S. C. Hausdorff dimension in graph directed constructions. Trans. Amer. Math. Soc. 309 (1988), 811–829.Google Scholar
[14] Orponen, T. On the distance sets of self-similar sets. Nonlinearity 25 (2012), 1919–1929. MR2929609Google Scholar
[15] Peres, Y. and Shmerkin, P. Resonance between Cantor sets. Ergodic Theory Dynam. Systems 29 (2009), 201–221. MR2470633 (2010a:28015)Google Scholar
[16] Schief, A. Separation properties for self-similar sets. Proc. Amer. Math. Soc. 122 (1994), 111–115.Google Scholar
[17] Wang, J.-L.. The open set conditions for graph directed self-similar sets. Random Comput. Dynam. 5 (1997), 283–305.Google Scholar