Related papers: Ends of iterated function systems
The use of iteration and piecewise functions allows analytic expression of the trajectories of an R\"ossler-like attractor, avoiding infinite series solution. It seems possible to extend this approach to other attractors, even if the…
We investigate the use of iterated function system (IFS) models for data analysis. An IFS is a discrete dynamical system in which each time step corresponds to the application of one of a finite collection of maps. The maps, which represent…
We study contraction conditions for an iterated function system of continuous maps on a metric space which are chosen randomly, identically and independently. We investigate metric changes, preserving the topological structure of the space,…
Enumeration of walks with small steps in the quadrant has been a topic of great interest in combinatorics over the last few years. In this article, it is shown how to compute exact asymptotics of the number of such walks with fixed start-…
Semigroups generated by topological operations such as closure, interior or boundary are considered. It is noted that some of these semigroups are in general finite and noncommutative. The problem is formulated whether they are always…
Let $E$ be the attractor of an iterated function system $\{\phi_i(x)=\rho R_ix+a_i\}_{i=1}^N$ on $\Bbb R^d$, where $0<\rho<1$, $a_i\in \Bbb R^d$ and $R_i$ are orthogonal transformations on $\Bbb R^d$. Suppose that $\{\phi_i\}_{i=1}^N$…
This paper provides an alternative description for the fixed points of the fractal operator associated with a mixed possibly infinite iterated function system via a canonical projection type function. Some visual aspects of our results are…
A discrete dynamical system in Euclidean m-space generated by the iterates of an asymptotically zero map f, satisfying f(x) goes to zero as x goes to infinity, must have a compact global attracting set $A $. The question of what additional…
We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points…
Suppose that $f$ is a transcendental entire function. In 2014, Rippon and Stallard showed that the union of the escaping set with infinity is always connected. In this paper we consider the related question of whether the union with…
We classify transcendental entire functions that are compositions of a polynomial and the exponential for which all singular values escape on disjoint rays. We focus on the case where the escape is degenerate in the sense that points from…
We study the set of invariant idempotent probabilities for place dependent idempotent iterated function systems defined in compact metric spaces. Using well-known ideas from dynamical systems, such as the Ma\~{n}\'{e} potential and the…
This is the first article in a two-part series containing some results on dimension estimates for $C^1$ iterated function systems and repellers. In this part, we prove that the upper box-counting dimension of the attractor of any $C^1$…
Mappings of a finite set into itself with restriction on the cycle lengths are considered (the so-called A-mappings). Asymptotics is given for the number of these mappings with a power-law reduction of the remainder.
We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…
We introduce the novel concept of a non-stationary iterated function system by considering a countable sequence of distinct set-valued maps $\{\mathcal{F}_k\}_{k\in \mathbb{N}}$ where each $\mathcal{F}_k$ maps $\mathcal{H}(X)\to…
We establish properties of a new type of fractal which has partial self similarity at all scales. For any collection of iterated functions systems with an associated probability distribution and any positive integer V there is a…
In this paper, we reformulate the definition of the iterated function systems (denoted by general IFSs in this paper) and show the existence and uniqueness (in some sense) of the limit sets generated by the general IFSs, to unify the…
Iterated function systems (IFS) can be a surprisingly useful tool for studying structure in data. Here we present results stemming from a 2013 computational study by the author using IFS. The results include fractal patterns that reveal…
We consider a long but finite (ladder) circuit with alternating connections of resistors in series and parallel and derive an explicit expression for its equivalent resistance as a function of the number of repeating blocks, $R_{\rm…