Related papers: Dynamics of the Induced Shift Map
We present a graph-theoretic model for dynamical systems $(X,\sigma)$ given by a surjective local homeomorphism $\sigma$ on a totally disconnected compact metrizable space $X$. In order to make the dynamics appear explicitly in the graph,…
The paper gives a characterisation of the chain relation of a sofic subshift. Every sofic subshift $\Sigma$ can be described by a labelled graph $G$. Factorising $G$ in a suitable way we obtain the graph $G/_\approx$ that offers insight…
In this paper, we investigate the dynamics on the hyperspace induced by a non-autonomous dynamical system $(X,\mathbb{F})$, where the non-autonomous system is generated by a sequence $(f_n)$ of continuous self maps on $X$. We relate the…
This paper presents a general and systematic discussion of various symbolic representations of iterated maps through subshifts. We give a unified model for all continuous maps on a metric space, by representing a map through a general…
In this paper we provide sufficient conditions in order to show that the set image of a continuous and shift-commuting map defined on a shift space over an arbitrary discrete alphabet is also a shift space; additionally, if such a map is…
Building on our previous work, we give a thorough presentation of the techniques developed for synchronizing dynamical systems in the special case of synchronizing shift spaces. Following work of Thomsen, we give a construction of the…
In this paper, we study the dynamics induced by finite commutative relation. We prove that the dynamics generated by such a non-trivial collection cannot be transitive/super-transitive and hence cannot exhibit higher degrees of mixing. As a…
We consider continuous, translation-commuting transformations of compact, translation-invariant families of mappingsfrom finitely generated groups into finite alphabets. It is well-known that such transformations and spaces can be described…
We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems.…
We introduce a new type of shift dynamics as an extended model of symbolic dynamics, and investigate the characteristics of shift spaces from the viewpoints of both dynamics and computation. This shift dynamics is called a functional shift…
We study approximation schemes for shift spaces over a finite alphabet using (pseudo)metrics connected to Ornstein's $\bar{d}$ metric. This leads to a class of shift spaces we call $\bar{d}$-approachable. A shift space…
For a commutative non-autonomous dynamical system we show that topological transitivity of the non-autonomous system induced on probability measures (hyperspaces) is equivalent to the weak mixing of the induced systems. Several counter…
Let $G$ be a finitely generated amenable group. We study the space of shifts on $G$ over a given finite alphabet $A$. We show that the zero entropy shifts are generic in this space, and that more generally the shifts of entropy $c$ are…
Given a compact metric space (X; \varrho) and a continuous function f:X\rightarrow X, we study the dynamics of the induced map \bar{f} on the hyperspace of the compact subsets of X. We show how the chain recurrent set of f and its…
We investigate the dynamics of substitution subshifts and their associated tiling spaces. For a given subshift, the associated tiling spaces are all homeomorphic, but their dynamical properties may differ. We give criteria for such a tiling…
In this paper we study the shifts, which are the shift-invariant and topologically closed sets of configurations over a finite alphabet in $\mathbb{Z}^d$. The minimal shifts are those shifts in which all configurations contain exactly the…
Motivated from the study of multiple ergodic average, the investigation of multiplicative shift spaces has drawn much of interest among researchers. This paper focuses on the relation of topologically mixing properties between…
In this paper, we investigate the dynamical behavior of a two dimensional shift $X_G$ (generated by a two dimensional graph $G=(\mathcal{H},\mathcal{V})$) using the adjacency matrices of the generating graph $G$. In particular, we…
Kengo Matsumoto has introduced lambda-graph systems and strong shift equivalence of lambda-graph systems [Doc.Math.4 (1999), 285-340]. We associate to a subshift of a subshift a lambda-graph system. The strong shift equivalence class of the…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…