On cut sets of attractors of iterated function systems

From MaRDI portal



Abstract: In this paper, we study cut sets of attractors of iteration function systems (IFS) in mathbbRd. Under natural conditions, we show that all irreducible cut sets of these attractors are perfect sets or single points. This leads to a criterion for the existence of cut points of IFS attractors. If the IFS attractors are self-affine tiles, our results become algorithmically checkable and can be used to exhibit cut points with the help of Hata graphs. This enables us to construct cut points of some self-affine tiles studied in the literature.


Let \(T\) be a connected attractor of an IFS consisting of injective contractions on \(\mathbb{R}^{d}\). A subset \(X\) of \(T\) is a cut set if \( T\setminus X\) is disconnected. Further, a cut set \(X\) is irreducible if \( T\setminus X_{0}\) is connected for any proper subset \(X_{0}\) of \(X\) which is closed in \(T\). In the paper under review, the authors provide sufficient conditions for an irreducible cut set of \(T\) to be perfect (i.e., free of isolated points) or to be a singleton. For a special sort of \(T\) (integral self-affine tiles with standard digit set), the authors show that those sufficient conditions can be checked algorithmically. Finally, they exhibit a method of detecting cut points of those special attractors.











This page was built for publication: On cut sets of attractors of iterated function systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817011)