Attractors of iterated function systems and associated graphs
The authors are interested in topological properties of the attractor of an intreated function system with possibly infinitely many functions. An iterated function system is a collection of mappings \(\{ f_i\}_{i \in I}\) from a metric space \((X,d)\) into itself. The attractor is a subset \(K \subset X\) such that \(X = \cup_{i \in I} f_i(K)\). It is a natural question whether topological information about \(K\) can be determined from the IFS itself. Connectivity has already been studied [\textit{A. Mihail}, Real Anal. Exch. 34, No. 1, 195--206 (2009; Zbl 1176.28005)]; [\textit{J. Kigami}, Analysis on fractals. Paperback reprint of the hardback edition 2001. Cambridge: Cambridge University Press (2008; Zbl 1143.28005)]; [\textit{M. Yamaguti} et al., Mathematics of fractals. Transl. from the Japanese by Kiki Hudson. Translations of Mathematical Monographs. 167. Providence, RI: American Mathematical Society (AMS). xi, 78 p. \$ 29.00 (1997; Zbl 0888.58030)]. The topological property of interest in this paper is whether or not \(K\) is a dendrite, defined as a connected metric space such that between any two points there is one class of parameterized curves connecting the two points and any two such curves have the same image in \(X\). The main tool to relate the structure of an attractor \(K\) to the IFS itself is via a ``graph of intersections. Let \(I\), the index set, and be the vertices of a graph. There is an edge between \(i,j \in I\) if \(f_i(K) \cap f_j(K) \neq \emptyset\). This graph is \(G_1\). Similarly \(G_m\) has \(I^{m}\) as a vertex set and \(\vec{i},\vec{j} \in I^{m}\) are connected by an edge if \(f_{i_m} \circ f_{i_1}(K) \cap f_{j_m} \circ f_{j_1}(K) \neq \emptyset.\) The main result of the paper is the following theorem: { Theorem:} \textit{If all the graphs \(\{G_m\}_{m=1}^{\infty}\) are trees then \(K\) is a dendrite.} Lastly there are several examples of self-similar fractals derived from iterated functions systems which are dendrites including Hata's tree-like set. The graph based analysis of the attractor of an iterated function system adds an interesting complement to graph-directed constructions of non-self-similar fractals in [\textit{R. D. Mauldin} and \textit{S. C. Williams}, Trans. Am. Math. Soc. 309, No. 2, 811--829 (1988; Zbl 0706.28007)].
- Recurrent iterated function systems
- Trees and hyperbolicity. The continuum self-similar tree
- Some remarks concerning the attractors of iterated function systems
- About the attractors of infinite iterated function systems
- Dendrite-type attractors of infinite iterated function systems
- Developments in fractal geometry
- On quasisymmetric structure parameterization of attractors of special graph-directed function systems
- Non-stationary versions of fixed-point theory, with applications to fractals and subdivision
- The dynamics of selfsimilar sets generated by multibranching trees
- THE BOUNDARY OF THE ATTRACTOR OF A RECURRENT ITERATED FUNCTION SYSTEM
- Gromov hyperbolic graphs arising from iterations
- Dendrite-type attractors of IFSs formed by two injective functions
- Self-similar dendrites generated by polygonal systems in the plane
- Graphs induced by iterated function systems
- Ends of iterated function systems
- About the attractors of infinite iterated function systems
- Some remarks concerning the attractors of iterated function systems
- scientific article; zbMATH DE number 695426 (Why is no real title available?)
- WHEN IS A RECURRENT IFS ATTRACTOR A STANDARD IFS ATTRACTOR?
- Connectedness of the attractors of iterated function systems
- On deformation of polygonal dendrites preserving the intersection graph
- Dendrite-type attractors of infinite iterated function systems
- Hyperbolic graphs induced by iterations and applications in fractals
- A note on Hata's tree-like sets
This page was built for publication: Attractors of iterated function systems and associated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q740770)
