Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

A Survey on the Topology of Fractal Squares

Jun Luo, Hui Rao

TL;DR

This survey investigates the topological structure of fractal squares $K(N,\mathcal{D})$ in the plane, focusing on component count, cut points, component geometry, and low-order classifications. It synthesizes tools such as Hata graphs, symbolic projections, the $\lambda$-function, and core decompositions to connect digit sets to topology, and uses finite-approximation sequences $K^{(j)}$ to derive decidable criteria. The authors provide a near-complete topological classification for $N=3$, describe the spectrum of possible component types (points, line segments, Cantor products, Peano continua, and Sierpiński carpet-like continua), and pose open questions about fundamental groups and detection from early approximations. Collectively, the work advances understanding of planar self-similar sets and motivates algorithmic topological decision problems for fractal constructions.

Abstract

We consider a special type of self-similar sets, called fractal squares, and give a brief review on recent results and unsolved issues with an emphasis on their topological properties.

A Survey on the Topology of Fractal Squares

TL;DR

This survey investigates the topological structure of fractal squares in the plane, focusing on component count, cut points, component geometry, and low-order classifications. It synthesizes tools such as Hata graphs, symbolic projections, the -function, and core decompositions to connect digit sets to topology, and uses finite-approximation sequences to derive decidable criteria. The authors provide a near-complete topological classification for , describe the spectrum of possible component types (points, line segments, Cantor products, Peano continua, and Sierpiński carpet-like continua), and pose open questions about fundamental groups and detection from early approximations. Collectively, the work advances understanding of planar self-similar sets and motivates algorithmic topological decision problems for fractal constructions.

Abstract

We consider a special type of self-similar sets, called fractal squares, and give a brief review on recent results and unsolved issues with an emphasis on their topological properties.
Paper Structure (6 sections, 33 theorems, 10 equations, 11 figures)

This paper contains 6 sections, 33 theorems, 10 equations, 11 figures.

Table of Contents

  1. Introduction
  2. The Number of Components
  3. Cut Points and Local Cut Points
  4. The Structure of the Components
  5. Topological Classification for $N=3$
  6. Note on Fundamental Groups

Key Result

Theorem 1

$\mathcal{G}_1(\mathcal{F})$ is connected if and only if $K$ is. In such a case, $K$ is a locally connected continuum.

Figures (11)

  • Figure 1: The first three approximations of $K\left(3,\mathcal{D}_S\right)$ in Example \ref{['exmp:sierpinski']}.
  • Figure 2: The approximations $K^{(j)}(j=1,2,3,6)$ of $K(3,\mathcal{D}_1)$ in Example \ref{['exmp:Hata_Graph']}.
  • Figure 3: The approximations $K^{(1)},K^{(2)}, K^{(4)}$ of $K=K(5,\mathcal{D})$ in Example \ref{['exmp:two_comp']}.
  • Figure 4: A magnified view of the approximation $K^{(2)}$ in Figure \ref{['fig:Xiao21']} and the points $x_j\ (0\le j\le4)$.
  • Figure 5: The first and the fourth approximations for $K(5,\mathcal{D}_A)$ and $K(5,\mathcal{D}_B)$ in Example \ref{['exmp:lambda']}.
  • ...and 6 more figures

Theorems & Definitions (61)

  • Definition 1
  • Definition 2
  • Definition 3
  • Remark 1
  • Example 1
  • Definition 4
  • Remark 2
  • Definition 5
  • Theorem 1: Hata85
  • Theorem 2: Ruan-Wang17
  • ...and 51 more