On totally disconnected generalised Sierpinski carpets

Ligia-Loreta Cristea, Bertran Steinsky

Research output: Contribution to journalArticlepeer-review

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
Original languageEnglish
Pages (from-to)27-34
JournalBulletin Mathématique de la Société des Sciences Mathématiques de Roumanie
Volume105
Issue number1
Publication statusPublished - 2014

Fields of Expertise

  • Information, Communication & Computing

Treatment code (Nähere Zuordnung)

  • Basic - Fundamental (Grundlagenforschung)

Fingerprint

Dive into the research topics of 'On totally disconnected generalised Sierpinski carpets'. Together they form a unique fingerprint.

Cite this