Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-26T08:27:53.914Z Has data issue: false hasContentIssue false
  • English
  • Français

Attractors of directed graph IFSs that are not standard IFS attractors and their Hausdorff measure

Published online by Cambridge University Press:  31 October 2012

G. C. BOORE  and
K. J. FALCONER
G. C. BOORE
Affiliation:
Mathematical Institute, University of St Andrews, North Haugh, St Andrews, Fife, KY16 9SS, Scotland. e-mail: [email protected], [email protected]
K. J. FALCONER
Affiliation:
Mathematical Institute, University of St Andrews, North Haugh, St Andrews, Fife, KY16 9SS, Scotland. e-mail: [email protected], [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

For directed graph iterated function systems (IFSs) defined on ℝ, we prove that a class of 2-vertex directed graph IFSs have attractors that cannot be the attractors of standard (1-vertex directed graph) IFSs, with or without separation conditions. We also calculate their exact Hausdorff measure. Thus we are able to identify a new class of attractors for which the exact Hausdorff measure is known.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 154 , Issue 2 , March 2013 , pp. 325 - 349
Copyright
Copyright © Cambridge Philosophical Society 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Ayer, E. and Strichartz, R. S.Exact Hausdorff measure and intervals of maximum density for Cantor sets. Trans. Amer. Math. Soc. 351 (1999), 3725–3741.CrossRefGoogle Scholar
[2]Barnsley, M. F.Fractals Everywhere (Academic Press, San Diego, 1993).Google Scholar
[3]Boore, G. C. Directed Graph Iterated Function Systems. Ph.D. thesis. School of Mathematics and Statistics, St Andrews University (October 2011), http://research-repository.st-andrews.ac.uk/handle/10023/2109.Google Scholar
[4]Delaware, R.Every set of finite Hausdorff measure is a countable union of sets whose Hausdorff measure and content coincide. Proc. Amer. Math. Soc. 131 (2002), 2537–2542.CrossRefGoogle Scholar
[5]Edgar, G. A.Measure, Topology and Fractal Geometry (Springer-Verlag, New York, 2000).Google Scholar
[6]Edgar, G. A. and Mauldin, R. D.Multifractal decompositions of digraph recursive fractals. Proc. London Math. Soc. (3) 65 (1992), 604–628.CrossRefGoogle Scholar
[7]Elekes, M., Keleti, T. and Máthé, A.Self-similar and self-affine sets: measure of the intersection of two copies. Ergodic Theory Dynam. Systems 30 (2010), 399–440.CrossRefGoogle Scholar
[8]Falconer, K. J.The Geometry of Fractal Sets (Cambridge University Press, 1985).CrossRefGoogle Scholar
[9]Falconer, K. J.Techniques in Fractal Geometry (John Wiley, Chichester, 1997).Google Scholar
[10]Falconer, K. J.Fractal Geometry, Mathematical Foundations and Applications (John Wiley, Chichester, 2nd Ed. 2003).CrossRefGoogle Scholar
[11]Feng, De-J. and Wang, Y.On the structures of generating iterated function systems of Cantor sets. Adv. Math. 222 (2009), 1964–1981.CrossRefGoogle Scholar
[12]Hutchinson, J.Fractals and self-similarity. Indiana Univ. Math. J. 30 (1981), 713–747.CrossRefGoogle Scholar
[13]Marion, J.Mesure de Hausdorff d'un fractal à similitude interne. Ann. sc. Qubec. 10 (1986), 51–84.Google Scholar
[14]Mauldin, R. D. and Williams, S. C.Hausdorff dimension in graph directed constructions. Trans. Amer. Math. Soc. 309 (1988), 811–829.CrossRefGoogle Scholar
[15]Seneta, E.Non-negative Matrices (George Allen & Unwin Ltd, London, 1973).Google Scholar
[16]Wang, J.The open set conditions for graph directed self-similar sets. Random Comput. Dynam. 5 (1997), 283–305.Google Scholar