Search arXivSearch

arXiv · 2607.07112

The Chain Graph of a general Iterated Function System

Abstract

Classical fractal geometry describes the metric and topological structure of attractors generated by contractive Iterated Function Systems (IFSs). Much less is known about their global qualitative dynamics once the contractive hypothesis is abandoned. In this article we focus on IFSs with "compact dynamics", namely those IFSs for which there exists a non-empty compact set invariant under the Hutchinson map that attracts every compact subset of the phase space. We call such a set the "global attractor" of the IFS. We introduce the "chain graph" of a general IFS as a directed graph encoding the qualitative dynamics features of the IFS. For an IFS with compact dynamics, the chain graph contains at least one node. Our main results are that the chain graph of an IFS with compact dynamics coincides with the chain graph of its restriction to its global attractor and that the chain graph of an IFS has at most as many nodes as the graph of its Hutchinson map.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Roberto De Leo. 2026-07-08. The Chain Graph of a general Iterated Function System. https://arxiv.org/abs/2607.07112

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS