Related papers: Ends of iterated function systems
This paper concerns the local connectedness of components of self-similar sets. Given an equal partition of the unit square into n*n small squares, we may choose arbitrarily two or more of them and form an iterated function system. The…
In an earlier paper, we proved the connectedness of the fibers of every $2n$-dimensional integrable system satisfying both: the action extends the action of an $(n-1)$-dimensional torus which has a proper moment map, and every tall singular…
We show that an arbitrary infinite graph can be compactified by its ${\aleph_0}$-tangles in much the same way as the ends of a locally finite graph compactify it in its Freudenthal compactification. In general, the ends then appear as a…
We provide an overview of iterated function systems (IFS), where randomly chosen state-to-state maps are applied iteratively to a state. We aim to summarize the state of art and, where possible, identify fundamental challenges and…
The main result of this paper states that for a given countable system of data, there exists a countable iterated function system consisting of Rakotch contractions, such that its attractor is the graph of a fractal interpolation function…
A \emph{data automaton} is a finite automaton equipped with variables (counters or registers) ranging over infinite data domains. A trace of a data automaton is an alternating sequence of alphabet symbols and values taken by the counters…
If the semigroup is slowly non-dissipative, i.e., its solutions can diverge to infinity as time tends to infinity, one still can study its dynamics via the approach by the unbounded attractors - the counterpart of the classical notion of…
We study the asymptotic dynamics of maps which are piecewise contracting on a compact space. These maps are Lipschitz continuous, with Lipschitz constant smaller than one, when restricted to any piece of a finite and dense union of disjoint…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…
We analyze a phase-field system where the energy balance equation is linearly coupled with a nonlinear and nonlocal ODE for the order parameter $\chi$. The latter equation is characterized by a space convolution term which models particle…
In this paper we define a degree for ends of infinite digraphs. The well-definedness of our definition in particular resolves a problem by Zuther. Furthermore, we extend our notion of end degree to also respect, among others, the vertices…
The orbit of a point $x\in X$ in a classical iterated function system (IFS) can be defined as $\{f_u(x)=f_{u_n}\circ\cdots \circ f_{u_1}(x):$ $u=u_1\cdots u_n$ is a word of a full shift $\Sigma$ on finite symbols and $f_{u_i}$ is a…
A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…
We study the dynamics of the exponential maps $E_{\lambda}: \mathbb{C} \longrightarrow \mathbb{C}$ defined by $E_{\lambda}(z) = \lambda e^z$, where $\lambda > \frac{1}{e}$. We prove that for itineraries of a certain form, the set of all…
We prove an extension of M. Hata's theorem [4] for planar Markov Iterated Function Systems satisfying a strong version of the Open Set Condition. More precisely, if the attractor of such a system is connected, then it is locally connected.…
This paper presents a sufficient condition for a continuum in $R^n$ to be embeddable in $R^n$ in such a way that its image is not an attractor of any iterated function system. An example of a continuum in $R^2$ that is not an attractor of…
Several structural properties of a universal algebra can be seen from the higher commutators of its congruences. Even on a finite algebra, the sequence of higher commutator operations is an infinite object. In the present paper, we exhibit…
We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.
The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…
Let C be a closed subset of a topological space X, and let f : C --> X. Let us assume that f is continuous and f(x) lies in C for every x in the boundary of C. How many times can one iterate f? This paper provides estimates on the number of…