On the topology of the limit set of non-autonomous IFS
Yuto Nakajima, Takayuki Watanabe
TL;DR
The paper develops a Čech-Sumi homology framework for limit sets of non-autonomous IFS, establishing an isomorphism between the inverse-limit (co)homology of a nested nerve system and the Čech (co)homology of the limit set $J$. It introduces a subcomplex-based long exact sequence to enable recursive computation of homology groups and proves a probabilistic total-disconnectedness result for random non-autonomous IFSs starting from a post-critically finite base. The authors apply the theory to non-autonomous fractal squares and their higher-dimensional generalizations, deriving precise connectivity criteria, percolation-type phenomena, and detailed 2D homology outcomes, including explicit ranks in various regimes. This work links fractal topology with random processes and dynamical systems, offering new tools to quantify topological complexity via homology and illuminating how overlap-driven structure shapes global connectivity. Overall, it extends fractal topology to non-autonomous and random settings, providing computationally tractable invariants and deepening connections between topology, dynamics, and fractal geometry.
Abstract
Fractals are ubiquitous in nature, and since Mandelbrot's seminal insight into their structure, there has been growing interest in them. While the topological properties of the limit sets of IFSs have been studied -- notably in the pioneering work of Hata -- many aspects remain poorly understood, especially in the non-autonomous setting. In this paper, we present a homological framework which captures the structure of the limit set. We apply our novel abstract theory to the concrete analysis of the so-called fractal square, and provide an answer to a variant of Mandelbrot's percolation problem. This work offers new insights into the topology of fractals.
