For any primitive substitution whose Perron eigenvalue is Pisot unit, we construct a domain exchange measurably conjugated to the subshift. And we give a condition for the subshift to be a finite extension of a torus translation. For the particular case of weakly irreducible Pisot substitution, we show that the subshift is either a finite extension of a torus translation, either a power of the subshift is weakly mixing. And we provide an algorithm to compute eigenvalues of the subshift associated to any primitive pseudo-unimodular substitution.
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 …
In the study of substitution minimal subshifts, some complicated trivialities have hindered simple and general approaches. Recently, Maloney and Rust introduced the term "tame," simplifying the study. We introduce another term "$l$-primitive" for the substitutions and show that the combination of these two conditions can characterize the minimality of substitution subshifts. We shall show that all substitution minimal subshifts can be generated by substitutions that satisfy both conditions; conversely, all substitutions that satisfy the two conditions always generate minimal subshifts. As an a…
We study various aspects of periodic points for random substitution subshifts. In order to do so, we introduce a new property for random substitutions called the disjoint images condition. We provide a procedure for determining the property for compatible random substitutions-random substitutions for which a well-defined abelianisation exists. We find some simple necessary criteria for primitive, compatible random substitutions to admit periodic points in their subshifts. In the case that the random substitution further has disjoint images and is of constant length, we provide a stronger crite…
We study dynamics of a substitution subshift given by the substitution a->aca, b->d, c->b, d->c that is related to the Grigorchuk group. This dynamical system is shown to be, up to a countable set, conjugated to the binary odometer.
The class of substitutions of some primitive components is introduced. A bilateral subshift arising from a substitution of some primitive components is decomposed into pairwise disjoint, locally compact, shift-invariant sets, on each of which an invariant Radon measure is unique up to scaling. It is completely characterized in terms of eigenvalues of an incidence matrix when the unique invariant measure is finite.
We construct a family of ergodic measures on random substitution subshifts (RS-subshifts) associated to a primitive random substitution. In particular, the word frequencies of every finite legal word exist for almost every element of the random substitution subshift with respect to these measures. As an application, we show that for a certain class of random substitutions the measures of maximal entropy are frequency measures.
We investigate topological mixing of compatible random substitutions. For primitive random substitutions on two letters whose second eigenvalue is greater than one in modulus, we identify a simple, computable criterion which is equivalent to topological mixing of the associated subshift. This generalises previous results on deterministic substitutions. In the case of recognisable, irreducible Pisot random substitutions, we show that the associated subshift is not topologically mixing. Without recognisability, we rely on more specialised methods for excluding mixing and we apply these methods t…
Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic, but the existing invariants are not sufficient for this purpose. We first show that given two minimal substitution subshifts, there exists a computable constant $R$ such that any factor map between these subshifts (if any) is the composition of a factor map with a radius smaller than $R$ and some power of the shift map. Then we prove that it is decidable to ch…
We study the topology and dynamics of subshifts and tiling spaces associated to non-primitive substitutions in one dimension. We identify a property of a substitution, which we call tameness, in the presence of which most of the possible pathological behaviours of non-minimal substitutions cannot occur. We find a characterization of tameness, and use this to prove a slightly stronger version of a result of Durand, which says that the subshift of a minimal substitution is topologically conjugate to the subshift of a primitive substitution. We then extend to the non-minimal setting a result obta…
We investigate substitution subshifts and tiling dynamical systems arising from the substitutions (1) θ: 0 \rightarrow 001,1 \rightarrow 11001 and (2) η: 0 \rightarrow 001,1 \rightarrow 11100. We show that the substitution subshifts arising from θand ηhave minimal self-joinings and are mildly mixing. We also give a criterion for 1-dimensional tiling systems arising from θor ηto have minimal self-joinings. We apply this to obtain examples of mildly mixing 1-dimensional tiling systems.
We prove that every topologically transitive shift of finite type in one dimension is topologically conjugate to a subshift arising from a primitive random substitution on a finite alphabet. As a result, we show that the set of values of topological entropy which can be attained by random substitution subshifts contains all Perron numbers and so is dense in the positive real numbers. We also provide an independent proof of this density statement using elementary methods.
We show how geometric methods from the general theory of fractal dimensions and iterated function systems can be deployed to study symbolic dynamics in the zero entropy regime. More precisely, we establish a dimensional characterization of the topological notion of amorphic complexity. For subshifts with discrete spectrum associated to constant length substitutions, this characterization allows us to derive bounds for the amorphic complexity by interpreting the subshift as the attractor of an iterated function system in a suitable quotient space. As a result, we obtain the general finiteness a…
For a homeomorphism $T \colon X \to X$ of a Cantor set $X$, the mapping class group $\mathcal{M}(T)$ is the group of isotopy classes of orientation-preserving self-homeomorphisms of the suspension $Σ_{T}X$. The group $\mathcal{M}(T)$ can be interpreted as the symmetry group of the system $(X,T)$ with respect to the flow equivalence relation. We study $\mathcal{M}(T)$, focusing on the case when $(X,T)$ is a minimal subshift. We show that when $(X,T)$ is a subshift associated to a substitution, the group $\mathcal{M}(T)$ is an extension of $\mathbb{Z}$ by a finite group; for a large class of sub…
The class of linearly recurrent Cantor systems contains the substitution subshifts and some odometers. For substitution subshifts and odometers measure--theoretical and continuous eigenvalues are the same. It is natural to ask whether this rigidity property remains true for the class of linearly recurrent Cantor systems. We give partial answers to this question.
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.
We study combinatorial properties of the subshift induced by the substitution that describes Lysenok's presentation of Grigorchuk's group of intermediate growth by generators and relators. This subshift has recently appeared in two different contexts: on one hand, it allowed to embed Grigorchuk's group in a topological full group, and on the other hand, it was useful in the spectral theory of Laplacians on the associated Schreier graphs.
We study stationary ordered Bratteli diagrams and give necessary and sufficient conditions for these orders to generate a continuous Vershik map. We apply this to finding adic representations for one sided substitution subshifts. We give an algorithm to find the branch points of a substitution, which have to be mapped to the minimal elements of such an ordering. We find adic representations for substitutions with one branch point, and also substitutions all of whose branch points are fixed.
We show that Sarnak's conjecture on Möbius disjointness holds for all subshifts given by bijective substitutions and some other similar dynamical systems, e.g.\ those generated by Rudin-Shapiro type sequences.
We consider a two-parameter family of random substitutions and show certain combinatorial and topological properties they satisfy. We establish that they admit recognisable words at every level. As a consequence, we get that the subshifts they define are not topologically mixing. We then show that they satisfy a weaker mixing property using a numeration system arising from a sequence of lengths of inflated words. Moreover, we provide explicit bounds for the corresponding topological entropy in terms of the defining parameters $n$ and $p$.
Unique ergodicity, and not, for primitive substitutions on compact alphabets containing isolated points
School of Mathematical Sciences, Mathematical Sciences Building, University Park, Nottingham, NG7 2RD, United Kingdom（数学科学学院，数学科学楼，大学公园，诺丁汉，NG7 2RD，英国）
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 space to be weakly mixing, and for the dynamics of two such spaces to be topologically conjugate.
We work with attracting subshifts generated by substitutions which are also irreducible parageometric automorphisms of free groups. For such a dynamical system, we construct a tree substitution to approximate the repelling real tree of the automorphism. We produce images of this tree inside the Rauzy fractal when the substitution is irreducible Pisot. We describe the contour of this tree and compute an interval exchange transformation of the circle covering the original substitution.
We set up a geometrical theory for the study of the dynamics of reducible Pisot substitutions. It is based on certain Rauzy fractals generated by duals of higher dimensional extensions of substitutions. We obtain under certain hypotheses geometric representations of stepped surfaces and related polygonal tilings, as well as self-replicating and periodic tilings made of Rauzy fractals. We apply our theory to an infinite family of substitutions. For this family, we analyze and interpret in a new combinatorial way the codings of a domain exchange defined on the associated fractal domains. We dedu…
We study a class of $\Z^{d}$-substitutive subshifts, including a large family of constant-length substitutions, and homomorphisms between them, i.e., factors modulo isomorphisms of $\Z^{d}$. We prove that any measurable factor map and even any homomorphism associated to a matrix commuting with the expansion matrix, induces a continuous one. We also get strong restrictions on the normalizer group, proving that any endomorphism is invertible, the normalizer group is virtually generated by the shift action and the quotient of the normalizer group by the automorphisms is restricted by the digit ti…
We give a sufficient geometric condition for a subshift to be measurably isomorphic to a domain exchange and to a translation on a torus. And for an irreducible unit Pisot substitution, we introduce a new topology on the discrete line and we give a simple necessary and sufficient condition for the symbolic system to have pure discrete spectrum. This condition gives rise to an algorithm based on computation of automata. To see the power of this criterion, we provide families of substitutions that satisfies the Pisot substitution conjecture: 1) $a \mapsto a^kbc$, $b \mapsto c$, $c \mapsto a$, fo…
In this article, we prove that for all pairs of primitive Pisot or uniform substitutions with the same dominating eigenvalue, there exists a finite set of block maps such that every block map between the corresponding subshifts is an element of this set, up to a shift.
We present a technique to lift some tilings of the discrete hyperbolic plane -- tilings defined by a 1D substitution -- into a zero entropy subshift of finite type (SFT) on non-abelian amenable Baumslag-Solitar groups $BS(1,n)$ for $n\geq2$. For well chosen hyperbolic tilings, this SFT is also aperiodic and minimal. As an application we construct a strongly aperiodic SFT on $BS(1,n)$ with a hierarchical structure, which is an analogue of Robinson's construction on $\mathbb{Z}^2$ or Goodman-Strauss's on $\mathbb{H}_2$.
Let $σ$ be a non-unit Pisot substitution and let $α$ be the associated Pisot number. It is known that one can associate certain fractal tiles, so-called \emph{Rauzy fractals}, with $σ$. In our setting, these fractals are subsets of a certain open subring of the adèle ring $\mathbb{A}_{\mathbb{Q}(α)}$. We present several approaches on how to define Rauzy fractals and discuss the relations between them. In particular, we consider Rauzy fractals as the natural geometric objects of certain numeration systems, define them in terms of the one-dimensional realization of $σ$ and its dual (in the spiri…
