Dimension theory of Non-Autonomous iterated function systems
Abstract: In the paper, we define a class of new fractals named non-autonomous attractors", which are the generalization of classic Moran sets and attractors of iterated function systems. Simply to say, we replace the similarity mappings by contractive mappings and remove the separation assumption in Moran structure. We give the dimension estimate for non-autonomous attractors. Furthermore, we study a class of non-autonomous attractors, named non-autonomous affine sets or affine sets'', where the contractions are restricted to affine mappings. To study the dimension theory of such fractals, we define two critical values $s*$ and $s_A$, and the upper box-counting dimensions and Hausdorff dimensions of non-autonomous affine sets are bounded above by $s*$ and $s_A$, respectively. Unlike self-affine fractals where $s*=s_A$, we always have that $s*\geq s_A$, and the inequality may strictly hold. Under certain conditions, we obtain that the upper box-counting dimensions and Hausdorff dimensions of non-autonomous affine sets may equal to $s*$ and $s_A$, respectively. In particular, we study non-autonomous affine sets with random translations, and the Hausdorff dimensions of such sets equal to $s_A$ almost surely.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.