Related papers: Factor maps between tiling dynamical systems

Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states that evolve deterministically and at discrete time steps. Considered up to isomorphism, those correspond to functional graphs. As such, FDSs…

The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the…

This article shows a very elementary and straightforward proof of the Implicit Function Theorem for differentiable maps $F(x,y)$ defined on a finite-dimensional Euclidean space. There are no hypothesis on the continuity of the partial…

Let $f$ be a harmonic map from a Riemann surface to a Riemannian $n$-manifold. We prove that if there is a holomorphic diffeomorphism $h$ between open subsets of the surface such that $f\circ h = f$, then $f$ factors through a holomorphic…

Topological mating is an combination that takes two same-degree polynomials and produces a new map with dynamics inherited from this initial pair. This process frequently yields a map that is Thurston-equivalent to a rational map $F$ on the…

We investigate what happens when we try to work with continuing block codes (i.e. left or right continuing factor maps) between shift spaces that may not be shifts of finite type. For example, we demonstrate that continuing block codes on…

Let $\mathbf{Y}$ be the solution space of an $n$-layer cellular neural network, and let $\mathbf{Y}^{(i)}$ and $\mathbf{Y}^{(j)}$ be the hidden spaces, where $1 \leq i, j \leq n$. ($\mathbf{Y}^{(n)}$ is called the output space.) The…

An important question in dynamical systems is the classification problem, i.e., the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive…

We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds…

We define a geometric flow that is designed to change surfaces of cylindrical type spanning two disjoint boundary curves into solutions of the Douglas-Plateau problem of finding minimal surfaces with given boundary curves. We prove that…

We prove that the linear combinations of functions $f_0,...,f_n$ in $H^\infty$ have "few" singular inner factors, provided that the $f_j$'s are suitably smooth up to the boundary, while in general this is no longer true.

A new method for constructing self-referential tilings of Euclidean space from a graph directed iterated function system, based on a combinatorial structure we call a pre-tree, is introduced. In the special case that we refer to as…

Given a factor code $\pi$ from a shift of finite type $X$ onto a sofic shift $Y$, the class degree of $\pi$ is defined to be the minimal number of transition classes over points of $Y$. In this paper we investigate structure of transition…

We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…

We construct algorithms and topological invariants that allow us to distinguish the topological type of a surface, as well as functions and vector fields for their topological equivalence. In the first part we discus the main structures…

A basic assumption of tiling theory is that adjacent tiles can meet in only a finite number of ways, up to rigid motions. However, there are many interesting tiling spaces that do not have this property. They have "fault lines", along which…

Let $\pi: (X,T)\rightarrow (Y,T)$ be a factor map of topological dynamics and $d\in {\mathbb {N}}$. $(Y,T)$ is said to be a $d$-step topological characteristic factor if there exists a dense $G_\delta$ set $X_0$ of $X$ such that for each…

We construct examples of minimal and uniquely ergodic systems realizing all possible behaviors in the interplay of measurable and topological nilfactors. To build such examples, we adapt an idea that stems from Furstenberg's construction of…

This note aims to bring attention to a simple class of discrete dynamical systems exhibiting some complex behaviour. Each of these systems is defined as a self-mapping of the unit square and is obtained by coupling two families of…

We study non-terminating graph rewriting models, whose local rules are applied non-deterministically -- and yet enjoy a strong form of determinism, namely space-time determinism. Of course in the case of terminating computation it is…