On totally disconnected generalised Sierpiński carpets
From MaRDI portal
Publication:3450832
zbMATH Open1389.28014arXiv1303.4883MaRDI QIDQ3450832FDOQ3450832
Authors: Ligia L. Cristea, Bertran Steinsky 
Publication date: 9 November 2015
Abstract: Generalised Sierpinski carpets are planar sets that generalise the well-known Sierpinski carpet and are defined by means of sequences of patterns. We study the structure of the sets at the kth iteration in the construction of the generalised carpet, for k greater than or equal to 1. Subsequently, we show that certain families of patterns provide total disconnectedness of the resulting generalised carpets. Moreover, analogous results hold even in a more general setting. Finally, we apply the obtained results in order to give an example of a totally disconnected generalised carpet with box-counting dimension 2.
Full work available at URL: https://arxiv.org/abs/1303.4883
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Fractals (28A80) Descriptive set theory (topological aspects of Borel, analytic, projective, etc. sets) (54H05)
Cited In (7)
- Title not available (Why is that?)
- Mixed labyrinth fractals
- The topological Hausdorff dimension and transport properties of Sierpiński carpets
- Connected generalised Sierpiński carpets
- On the existence of cut points of connected generalized Sierpiński carpets
- Connectedness and local cut points of generalized Sierpiński carpets
- Title not available (Why is that?)
This page was built for publication: On totally disconnected generalised Sierpiński carpets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3450832)
