Related papers: Ends of iterated function systems

For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…

We describe a new notation for finite transformations. This attractor-cycle notation extends the orbit-cycle notation for permutations and builds upon existing transformation notations. How the basins of attraction of a finite…

We consider linear iterated function systems (IFS) with a constant contraction ratio in the plane for which the "overlap set" $\Ok$ is finite, and which are "invertible" on the attractor $A$, the sense that there is a continuous surjection…

This paper introduces iterated monodromy groups for transcendental functions and discusses them in the simplest setting, for post-singularly finite exponential functions. These groups are self-similar groups in a natural way, based on an…

Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…

We investigate some connectedness properties of the set of points K(f) where the iterates of an entire function f are bounded. In particular, we describe a class of transcendental entire functions for which an analogue of the…

In the first half of the paper, some recent advances in coupled dynamical systems, in particular, a globally coupled map are surveyed. First, dominance of Milnor attractors in partially ordered phase is demonstrated. Second, chaotic…

Every quasi-attractor of an iterated function system (IFS) of continuous functions on a first-countable Hausdorff topological space is renderable by the probabilistic chaos game. By contrast, we prove that the backward minimality is a…

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

While the forward trajectory of a point in a discrete dynamical system is always unique, in general a point can have infinitely many backward trajectories. The union of the limit points of all backward trajectories through $x$ was called by…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

A fractal function is a function whose graph is the attractor of an iterated function system. This paper generalizes analytic continuation of an analytic function to continuation of a fractal function.

We examine two questions regarding Fourier frequencies for a class of iterated function systems (IFS). These are iteration limits arising from a fixed finite families of affine and contractive mappings in $\br^d$, and the ``IFS'' refers to…

Let $f$ be a transcendental entire function and let $A(f)$ denote the set of points that escape to infinity `as fast as possible' under iteration. By writing $A(f)$ as a countable union of closed sets, called `levels' of $A(f)$, we obtain a…

Let $f$ be a transcendental entire function. The escaping set $I(f)$ consists of those points that tend to infinity under iteration of $f$. We show that $I(f)$ is not $\sigma$-compact, resolving a question of Rippon from 2009.

Following the work of Louisa and Michael Barnsley on results in tops of iterated function systems, we extend their work to graph-directed iterated function systems by investigating the relationship between top addresses and shift spaces.…

A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…

Consider the entire function $f(z)=\cosh(z)$. We show that the escaping set of this function - that is, the set of points whose orbits tend to infinity under iteration - has a structure known as a "spider's web". This disproves a conjecture…

We consider iterated functions systems (IFS) on compact metric spaces and introduce the concept of target sets. Such sets have very rich dynamical properties and play a similar role as semifractals introduced by Lasota and Myjak do for…

Let $\Lambda$ be a countable index set and $S=\{\phi_i: i\in \Lambda\}$ be a conformal iterated function system on $[0,1]^d$ satisfying the open set condition. Denote by $J$ the attractor of $S$. With each sequence $(w_1,w_2,...)\in…