A dichotomy on the self-similarity of graph-directed attractors
Date
2024Metadata
Show full item recordAbstract
This paper seeks conditions that ensure that the attractor of a graph directed iterated function system (GD-IFS) cannot be realised as the attractor of a standard iterated function system (IFS). For a strongly connected directed graph, it is known that, if all directed circuits go through a vertex, then for any GD-IFS of similarities on ℝ based on the graph and satisfying the convex open set condition (COSC), its attractor associated with this vertex is also the attractor of a (COSC) standard IFS. In this paper we show the following complementary result. If a directed circuit does not go through a vertex, then there exists a GD-IFS based on the graph such that the attractor associated with this vertex is not the attractor of any standard IFS of similarities. Indeed, we give algebraic conditions for such GD-IFS attractors not to be attractors of standard IFSs, and thus show that `almost-all' COSC GD-IFSs based on the graph have attractors associated with this vertex that are not the attractors of any COSC standard IFS.
Citation
Falconer , K J , Hu , J & Zhang , J 2024 , ' A dichotomy on the self-similarity of graph-directed attractors ' , Journal of Fractal Geometry , vol. 11 , no. 1/2 , pp. 161–204 . https://doi.org/10.4171/jfg/140
Publication
Journal of Fractal Geometry
Status
Peer reviewed
DOI
10.4171/jfg/140ISSN
2308-1309Type
Journal article
Description
Funding: This work was supported by the National Natural Science Foundation of China (No. 12271282).Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.