Abstract
Generalised Sierpiński carpets are planar sets that generalise the well-known Sierpiński 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 ≥ 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
| Originalsprache | englisch |
|---|---|
| Seiten (von - bis) | 27-34 |
| Fachzeitschrift | Bulletin Mathématique de la Société des Sciences Mathématiques de Roumanie |
| Jahrgang | 105 |
| Ausgabenummer | 1 |
| Publikationsstatus | Veröffentlicht - 2014 |
Fields of Expertise
- Information, Communication & Computing
Treatment code (Nähere Zuordnung)
- Basic - Fundamental (Grundlagenforschung)