Related papers: Ends of iterated function systems
Iterated Graph Systems (IGS) transplant ideas from fractal geometry into graph theory. Building on this framework, we extend Edge IGS from the primitive to the reducible setting. Within this broader context, we formulate rigorous…
We consider the maximal number of arbitrary points in a special fibre that can be simultaneously approached by points in one sequence of general fibres. Several results about this topological invariant and their applications describe the…
Modules were introduced as an extension of Boolean automata networks. They have inputs which are used in the computation said modules perform, and can be used to wire modules with each other. In the present paper we extend this new…
The paper examines a trapped one-dimensional system of multicomponent spinless fermions that interact with a zero-range two-body potential. We show that when the repulsion between particles is very large the system can be approached…
We consider convex sets and functions over idempotent semifields, like the max-plus semifield. We show that if $K$ is a conditionally complete idempotent semifield, with completion $\bar{K}$, a convex function $K^n\to\bar{K}$ which is lower…
We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…
Based on the work of Shelah, Kellner, and T\u{a}nasie (Fund. Math., 166(1-2):109-136, 2000 and Comment. Math. Univ. Carolin., 60(1):61-95, 2019), and the recent developments in the third author's master's thesis, we develop a general theory…
Let f:A-->B be a covering map. We say A has e filtered ends with respect to f (or B) if for some filtration {K_n} of B by compact subsets, A - f^{-1}(K_n) "eventually" has e components. The main theorem states that if Y is a (suitable) free…
Let $\Lambda$ be a complete metric space, and let $\{S_\lambda(\cdot):\ \lambda\in\Lambda\}$ be a parametrised family of semigroups with global attractors ${\mathscr A}_\lambda$. We assume that there exists a fixed bounded set $D$ such that…
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…
A degenerate dynamical system is characterized by a state-dependent multiplier of the time derivative of the state in the time evolution equation. It can give rise to Hamiltonian systems whose symplectic structure possesses a non-constant…
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…
This note presents an approach to studying the iterates of a mapping whose restriction to the complement of a finite set is continuous and open. The main examples to which the approach can be applied are piecewise monotone mappings defined…
For any continuous probability measure $\mu$ on ${\mathbb R}$ we construct an IFS with probabilities having $\mu$ as its unique measure-attractor.
We study random independent and identically distributed iterations of functions from an iterated function system of homeomorphisms on the circle which is minimal. We show how such systems can be analyzed in terms of iterated function…
In this paper, we give a survey of the known results concerning the tensor rank of the multiplication in finite fields and we establish new asymptotical and not asymptotical upper bounds about it.
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…
We introduce the concept of F-decomposable systems, well-ordered inverse systems of Hausdorff compacta with fully closed bonding mappings. A continuous mapping between Hausdorff compacta is called fully closed if the intersection of the…
This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a mathematical theory of computer simulation. It contains a classification of finite dynamical systems on binary strings, which are obtained by…