Fractal squares with finitely many connected components *
Author:
- 18 February 2021
- journal article
- research article
- Published by IOP Publishing in Nonlinearity
- Vol. 34 (4) , 1817-1836
Abstract
In this paper, we present an effective method to characterize completely when a disconnected fractal square has only finitely many connected components. Our method is to establish some graph structures on fractal squares to reveal the evolution of the connectedness during their geometric iterated construction. We also prove that every fractal square contains either finitely or uncountably many connected components. A few examples, including the construction of fractal squares with exactly m ⩾ 2 connected components, are added in addition.Keywords
All Related Versions
Funding Information
- National Natural Science Foundation of China (11771391)
This publication has 13 references indexed in Scilit:
- Lipschitz equivalence of self-similar sets and hyperbolic boundariesAdvances in Mathematics, 2013
- Topological structure of fractal squaresMathematical Proceedings of the Cambridge Philosophical Society, 2013
- Lipschitz Equivalence of Self-Similar Sets: Algebraic and Geometric Properties2013
- Lipschitz equivalence of Cantor sets and algebraic properties of contraction ratiosTransactions of the American Mathematical Society, 2012
- Connected generalised Sierpiński carpetsTopology and its Applications, 2010
- Gap sequence, Lipschitz equivalence and box dimension of fractal setsNonlinearity, 2008
- TOPOLOGICAL STRUCTURE OF SELF-SIMILAR SETSFractals, 2002
- On the Lipschitz equivalence of Cantor setsMathematika, 1992
- Self‐Similar Sets 2. A Simple Approach to the Topological Structure of FractalsMathematische Nachrichten, 1991
- On the structure of self-similar setsJapan Journal of Applied Mathematics, 1985