We introduce subshifts of quasi-finite type as a generalization of the well-known subshifts of finite type. This generalization is much less rigid and therefore contains the symbolic dynamics of many non-uniform systems, e.g., piecewise monotonic maps of the interval with positive entropy. Yet many properties remain: existence of finitely many ergodic invariant probabilities of maximum entropy; lots of periodic points; meromorphic extension of the Artin-Mazur zeta function.
We prove that a shift ergodic measure on a topologically mixing sub-shift is isomorphic to a Bernoulli shift whenever it is quasi invariant under permutations of finite number of coordinates. We prove also that Gibbs measures on topologically mixing subshift of finite type are quasi invariant.
We study one-sided substitution subshifts, and how they can be represented using Bratteli-Vershik systems. In particular we focus on minimal recognizable substitutions such that the generated one-sided substitution subshift contains only one non-shift-invertible element (a branch point), and we call these substitutions quasi-invertible. We give an algorithm to check whether a substitution is quasi-invertible, and show that any substitution with a rational Perron value is orbit equivalent to a quasi-invertible substitution. If the quasi-invertible substitution is left proper, then its subshift …
A minimal subshift $(X,T)$ is linearly recurrent if there exists a constant $K$ so that for each clopen set $U$ generated by a finite word $u$ the return time to $U$, with respect to $T$, is bounded by $K|u|$. We prove that given a linearly recurrent subshift $(X,T)$ the set of its non-periodic subshift factors is finite up to isomorphism. We also give a constructive characterization of these subshifts.
We introduce the quasiminimal subshifts, subshifts having only finitely many subsystems. With $\mathbb{N}$-actions, their theory essentially reduces to the theory of minimal systems, but with $\mathbb{Z}$-actions, the class is much larger. We show many examples of such subshifts, and in particular construct a universal system with only a single proper subsystem, refuting a conjecture of [Delvenne, Kůrka, Blondel, '05].
A necessary and sufficient condition is given for the existence of an embedding of an irreducible subshift of finite type into the Fibonacci-Dyck shift
We prove in this text a characterization of the possible entropy dimensions of minimal tridimensional subshifts of finite type with a computability condition, using Goldbach's theorem on Fermat numbers.
In this note we show that for any subshift $X$ of finite $S$-rank every invariant measure $μ$ is determined by its values on finitely many cylinders. Under mild conditions these cylinders are given by the letters of the alphabet in question.
In this note we prove that Moebius orthogonality does not hold for subshifts of finite type with positive topological entropy. This, in particular, shows that all $C^{1+α}$ surface diffeomorphisms with positive entropy correlate with the Moebius function.
We prove an escape rate result for special semi-flows over non-invertible subshifts of finite type. Our proofs are based on a discretisation of the flow and an application of an escape rate result for conformal repellers.
Domino tilings have been studied extensively for both their statistical properties and their dynamical properties. We construct a subshift of finite type using matching rules for several types of dominos. We combine the previous results about domino tilings to show that our subshift of finite type has a measure of maximal entropy with which the subshift has completely positive entropy but is not isomorphic to a Bernoulli shift.
We study equidistribution of certain subsets of periodic orbits for subshifts of finite type. Our results solely rely on the growth of these subsets. As a consequence, effective equidistribution results are obtained for both hyperbolic diffeomorphisms and expanding maps on compact manifolds.
We prove that a subshift $(X,T)$ is linearly recurrent if and only if it is a primitive and proper $S$-adic subshift. This corrects Proposition 6 in F. Durand ({\it Ergod. Th. & Dynam. Sys. {\bf 20}} (2000), 1061--1078).
This paper studies several aspects of symbolic factors of $\mathcal{S}$-adic subshifts of finite alphabet rank. First, we address a problem raised in [DDPM20] about the topological rank of symbolic factors of $\mathcal{S}$-adic subshifts and prove that this rank is at most the one of the extension system, improving results from [E20] and [GH2020]. As a consequence of our methods, we prove that finite topological rank systems are coalescent. Second, we investigate the structure of fibers $π^{-1}(y)$ of factor maps $π\colon(X,T)\to(Y,T)$ between minimal $\mathcal{S}$-adic subshifts of finite alp…
This paper studies several aspects of symbolic ({\em i.e.}\ subshift) factors of $\mathcal{S}$-adic subshifts of finite alphabet rank. First, we address a problem raised in [DDPM20] about the topological rank of symbolic factors of $\mathcal{S}$-adic subshifts and prove that this rank is at most the one of the extension system, improving results from [E20] and [GH2020]. As a consequence of our methods, we prove that finite topological rank systems are coalescent. Second, we investigate the structure of fibers $π^{-1}(y)$ of factor maps $π\colon(X,T)\to(Y,S)$ between minimal $\mathcal{S}$-adic …
We define the finite extension property for $d$-dimensional subshifts, which generalizes the topological strong spatial mixing condition defined by Briceño (2016), and we prove that this property is invariant under topological conjugacy. Moreover, we prove that for every $d$, every $d$-dimensional block gluing subshift factors onto every $d$-dimensional subshift which has strictly lower entropy, a fixed point, and the finite extension property. This result extends a theorem from Boyle, Pavlov, and Schraudner (2010), which requires that the factor contain a safe symbol.
It has been recently proved that the automorphism group of a minimal subshift with non-superlinear word complexity is virtually $\mathbb{Z}$ [DDPM15, CK15]. In this article we extend this result to a broader class proving that the automorphism group of a minimal S-adic subshift of finite alphabet rank is virtually $\mathbb{Z}$. The proof is based on a fine combinatorial analysis of the asymptotic classes in this type of subshifts, which we prove are a finite number.
Minimal Cantor systems of finite topological rank (that can be represented by a Bratteli-Vershik diagram with a uniformly bounded number of vertices per level) are known to have dynamical rigidity properties. We establish that such systems, when they are expansive, define the same class of systems, up to topological conjugacy, as primitive and recognizable ${\mathcal S}$-adic subshifts. This is done establishing necessary and sufficient conditions for a minimal subshift to be of finite topological rank. As an application, we show that minimal subshifts with non-superlinear complexity (like all…
For each $n, d \in \mathbb{N}$ and $0 < α< 1$, we define a random subset of $\mathcal{A}^{\{1, 2, \dots, n\}^d}$ by independently including each element with probability $α$ and excluding it with probability $1-α$, and consider the associated random subshift of finite type. Extending results of McGoff and of McGoff and Pavlov, we prove there exists $α_0 = α(d, |\mathcal{A}|) > 0$ such that for $α< α_0$ and with probability tending to $1$ as $n \to \infty$, this random subshift will contain only finitely many elements. In the case $d = 1$, we obtain the best possible such $α_0$, $1/|\mathcal{A}…
We prove strong laws of large numbers under intermediate trimming for Birkhoff sums over subshifts of finite type. This gives another application of a previous trimming result only proven for interval maps. In case of Markov measures we give a further example of St.\ Petersburg type distribution functions. To prove these statements we introduce the space of quasi-Hölder continuous functions for subshifts of finite type.
In this paper we consider the structure of $ω$-limit sets in subshifts of Baire space. We consider both subshifts of finite type and subshifts of bounded type and we demonstrate that many classical structure theorems for $ω$-limit sets fail in this context. Nevertheless, we obtain characterizations of $ω$-limit sets in subshift of finite types and of attracting $ω$-limit sets in subshifts of bounded type.
We bound the change in entropy incurred by an irreducible subshift of finite type upon perturbing it by forbidding a pair of admissible words. Lind has proven such bounds in the one-word case, and we adapt his methods. In particular, we introduce multi-word correlation polynomials and study their size, as well as that of their determinant in the two-word case.
We study implications of expansiveness and pointwise periodicity for certain groups and semigroups of transformations. Among other things we prove that every pointwise periodic finitely generated group of cellular automata is necessarily finite. We also prove that a subshift over any finitely generated group that consists of finite orbits is finite, and related results for tilings of Euclidean space.
Given an SFT $Σ$ and a finite set $S$ of finite words, let $Σ\langle S\rangle$ denote the subshift of $Σ$ that avoids $S$. We establish a general criterion under which we can bound the entropy perturbation $h(Σ)-h(Σ\langle S\rangle)$ from above. As an application, we prove that this entropy difference tends to zero with a sequence of such sets $S_1, S_2, \dots$ under various assumptions on the $S_i$.
Let $X\subset A^{Z^d}$ be a $2$-dimensional subshift of finite type. We prove that any $2$-dimensional multidimensional subshift of finite type can be characterized by a square matrix of infinite dimension. We extend our result to a general $d$-dimensional case. We prove that the multidimensional shift space is non-empty if and only if the matrix obtained is of positive dimension. In the process, we give an alternative view of the necessary and sufficient conditions obtained for the non-emptiness of the multidimensional shift space. We also give sufficient conditions for the shift space $X$ to…
In this paper we study the quenched distributions of hitting times for a class of random dynamical systems. We prove that hitting times to dynamically defined cylinders converge to a Poisson point process under the law of random equivariant measures with super-polynomial decay of correlations. In particular, we apply our results to uniformly aperiodic random subshifts of finite type equipped with random invariant Gibbs measures. We emphasize that we make no assumptions about the mixing property of the marginal measure.
We consider the problem of when a symbolic dynamical system supports a Borel probability measure that is invariant under every element of its automorphism group. It follows readily from a classical result of Parry that the full shift on finitely many symbols, and more generally any mixing subshift of finite type, supports such a measure. Frisch and Tamuz recently dubbed such measures characteristic, and further showed that every zero entropy subshift has a characteristic measure. While it remains open if every subshift over a finite alphabet has a characteristic measure, we define a new class …
Consider a Hölder continuous potential $ϕ$ defined on the full shift $A^\nn$, where $A$ is a finite alphabet. Let $X\subset A^\nn$ be a specified sofic subshift. It is well-known that there is a unique Gibbs measure $μ_ϕ$ on $X$ associated to $ϕ$. Besides, there is a natural nested sequence of subshifts of finite type $(X_m)$ converging to the sofic subshift $X$. To this sequence we can associate a sequence of Gibbs measures $(μ_ϕ^m)$. In this paper, we prove that these measures weakly converge at exponential speed to $μ_ϕ$ (in the classical distance metrizing weak topology). We also establish…
R. Burton and J. Steif developed a strategy to construct examples of strongly irreducible subshifts of finite type admitting several measures of maximal entropy. This strategy exploits a correspondence between equilibrium statistical mechanics and symbolic dynamics, correspondence which was later formalized by O. Häggström. In this paper, we revisit and discuss this correspondence with the aim of presenting a simplified version of it, and to expose some applications of rigorous results concerning the Potts model and the six-vertex model to symbolic dynamics, illustrating in this way of the pos…
This paper establishes topological (equi-)semiconjugacy and (equi-)conjugacy between induced non-autonomous set-valued systems and subshifts of finite type. First, some necessary and sufficient conditions are given for a non-autonomous discrete system to be topologically semiconjugate or conjugate to a subshift of finite type. Further, several sufficient conditions for it to be topologically equi-semiconjugate or equi-conjugate to a subshift of finite type are obtained. Consequently, estimations of topological entropy and several criteria of Li-Yorke chaos and distributional chaos in a sequenc…
On surjunctive and injunctive subshifts of finite type
Università del Sannio（桑尼奥大学）；Istituto Nazionale di Alta Matematica “Francesco Severi”（弗朗切斯科·塞维利高等数学国立研究所）；Université de Strasbourg, CNRS, IRMA UMR 7501（斯特拉斯堡大学）；University of Turku（图尔库大学）
Let $K\subset \mathbb{R}$ be a self-similar set generated by some iterated function system. In this paper we prove, under some assumptions, that $K$ can be identified with a subshift of finite type. With this identification, we can calculate the Hausdorff dimension of $K$ as well as the set of elements in $K$ with unique codings using the machinery of Mauldin and Williams \cite{MW}. We give three different applications of our main result. Firstly, we calculate the Hausdorff dimension of the set of points of $K$ with multiple codings. Secondly, in the setting of $β$-expansions, when the set of …
In this text, we prove then that any minimal effective dynamical system on a Cantor set $\mathcal{A}^{\mathbb{N}}$ can be simulated by a minimal $\mathbb{Z}^3$-SFT, in a sense that we explicit here. This notion is a generalization of simulation by factor and sub-action defined by Hochman.
We discuss a method of calculating the zeta function of subshifts which have a presentation by a finite directed graph labeled by elements of the associated inverse semigroup. This class of subshifts is introduced as a class of property A subshifts(T.Hamachi, K.Inoue and W.Krieger/Subsystems of finite type and semigroup invariants of subshifts, preprint), and the Dyck shift and the Motzkin shift are representative subshifts in this class. The exact number of the periodic points and entropies are also given by this method, and these values are used in the embedding condition for an irreducible …
\textsc{J. Hadamard} studied the geometric properties of geodesic flows on surfaces of negative curvature, thus initiating "Symbolic Dynamics". In this article, we follow the same geometric approach to study the geodesic trajectories of billiards in "rational polygons" on the hyperbolic plane. We particularly show that the billiard dynamics resulting thus are just 'Subshifts of Finite Type' or their dense subsets. We further show that 'Subshifts of Finite Type' play a central role in subshift dynamics and while discussing the topological structure of the space of all subshifts, we demonstrate …
In their recent paper [KNS2019], the first author, S. Kiriki, and T. Soma introduced a concept of pointwise emergence to measure the complexity of irregular orbits. They constructed a residual subset of the full shift with high pointwise emergence. In this paper we consider the set of points with high pointwise emergence for topologically mixing subshifts of finite type. We show that this set has full topological entropy, full Hausdorff dimension, and full topological pressure for any Hölder continuous potential. Furthermore, we show that this set belongs to a certain class of sets with large …
We examine thermodynamic formalism for a class of renormalizable dynamical systems which in the symbolic space is generated by the Thue-Morse substitution, and in complex dynamics by the Feigenbaum-Coullet-Tresser map. The basic question answered is whether fixed points $V$ of a renormalization operator $\CR$ acting on the space of potentials are such that the pressure function $γ\mapsto \CP(-γV)$ exhibits phase transitions. This extends the work by Baraviera, Leplaideur and Lopes on the Manneville-Pomeau map, where such phase transitions were indeed detected. In this paper, however, the attra…
Simon's subshift conjecture states that for every aperiodic minimal subshift of Verblunsky coefficients, the common essential support of the associated measures has zero Lebesgue measure. We disprove this conjecture in this paper, both in the form stated and in the analogous formulation of it for discrete Schrödinger operators. In addition we prove a weak version of the conjecture in the Schrödinger setting. Namely, under some additional assumptions on the subshift, we show that the density of states measure, a natural measure associated with the operator family and whose topological support i…
We introduce a class of subshifts governed by finitely many two-sided infinite words. We call these words leading sequences. We show that any locally constant cocycle over such a subshift is uniform. From this we obtain Cantor spectrum of Lebesgue measure zero for associated Jacobi operators if the subshift is aperiodic. Our class covers all simple Toeplitz subshifts as well as all Sturmian subshifts. We apply our results to the spectral theory of Schreier graphs for uncountable families of groups acting on rooted trees.
$λ$-graph systems are labeled Bratteli diagram with shift operations. They present subshifts. Their matrix presentations are called symbolic matrix systems. We define skew products of $λ$-graph systems and study extensions of subshifts by finite groups. We prove that two canonical symbolic matrix systems are $G$-strong shift equivalent if and only if their presented subshifts are $G$-conjugate. $G$-equivalent classes of subshifts are classified by the cohomology classes of their associated skewing functions.
In this article we study how a subshift can simulate another one, where the notion of simulation is given by operations on subshifts inspired by the dynamical systems theory (factor, projective subaction...). There exists a correspondence between the notion of simulation and the set of forbidden patterns. The main result of this paper states that any effective subshift of dimension d -- that is a subshift whose set of forbidden patterns can be generated by a Turing machine -- can be obtained by applying dynamical operations on a subshift of finite type of dimension d + 1 -- a subshift that can…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group, study its algebraic properties, and use them to distinguish many of the stabilized automorphism groups. We also show that for a full shift, the subgroup of the stabilized automorphism group generated by elements of finite order is simple, and that the stabilized automorphism group is an extension of a free abelian group of finite rank by this simple group.
In this paper, we describe the relationship between the Perron root and eigenvectors of an irreducible subshift of finite type with the correlation between the forbidden words in the subshift. In particular, we derive an expression for the Perron eigenvectors of the associated adjacency matrix. As an application, we obtain the Perron eigenvectors for irreducible $(0,1)$ matrices which are adjacency matrices for directed graphs. Moreover, we derive an alternate definition of the Parry measure in ergodic theory on an irreducible subshift of finite type.
We show the Williams Conjecture is false for irreducible shifts of finite type by examining relative sign-gyration numbers of conjugacies between shifts with no points of period one or two.
In this paper we study the directions of periodicity of three-dimensional subshifts of finite type (SFTs) and in particular their slopes. A configuration of a subshift has a slope of periodicity if it is periodic in exactly one direction, the slope being the angle of the periodicity vectors. In this paper, we prove that any $Σ^0_2$ set may be realized as a a set of slopes of an SFT.
Let $G$ be a residually finite group and let $A$ be a finite set. We prove that if $X \subset A^G$ is a strongly irreducible subshift of finite type containing a periodic configuration then periodic configurations are dense in $X$. The density of periodic configurations implies in particular that every injective endomorphism of $X$ is surjective and that the group of automorphisms of $X$ is residually finite. We also introduce a class of subshifts $X \subset A^\Z$, including all strongly irreducible subshifts and all irreducible sofic subshifts, in which periodic configurations are dense.
In this paper, we provide an effective method to compute the topological entropies of $G$-subshifts of finite type ($G$-SFTs) with $G=F_{d}$ and $S_{d}$, the free group and free semigroup with $d$ generators respectively. We develop the entropy formula by analyzing the corresponding systems of nonlinear recursive equations (SNREs). Four types of SNREs of $S_{2}$-SFTs, namely the types $\mathbf{E},\mathbf{D},\mathbf{C}$ and $\mathbf{O}$, are introduced and we could compute their entropies explicitly. This enables us to give the complete characterization of $S_{2}$-SFTs on two symbols. That is, …
We give strongly aperiodic subshifts of finite type on every hyperbolic surface group; more generally, for each pair of expansive primitive symbolic substitution systems with incommensurate growth rates, we construct strongly aperiodic subshifts of finite type on their orbit graphs.
