Abstract
At the turn of this century Durand, and Lagarias and Pleasants established that key features of minimal subshifts (and their higherdimensional analogues) to be studied are linearly repetitive, repulsive and power free. Since then, generalisations and extensions of these features, namely \(\alpha \)repetitive, \(\alpha \)repulsive and \(\alpha \)finite (\(\alpha \ge 1\)), have been introduced and studied. We establish the equivalence of \(\alpha \)repulsive and \(\alpha \)finite for general subshifts over finite alphabets. Further, we studied a family of aperiodic minimal subshifts stemming from Grigorchuk’s infinite 2group G. In particular, we show that these subshifts provide examples that demonstrate \(\alpha \)repulsive (and hence \(\alpha \)finite) is not equivalent to \(\alpha \)repetitive, for \(\alpha > 1\). We also give necessary and sufficient conditions for these subshifts to be \(\alpha \)repetitive, and \(\alpha \)repulsive (and hence \(\alpha \)finite). Moreover, we obtain an explicit formula for their complexity functions from which we deduce that they are uniquely ergodic.
Introduction
Aperiodic subshifts over finite alphabets play a vital role in various branches of mathematics, physics, and computer science. The theory of aperiodic order is a relatively young field of mathematics, which has attracted considerable attention in recent years, see for instance [1,2,3, 16, 25, 27, 28, 35,36,37]. It has grown rapidly over the past three decades; on the one hand, due to the experimental discovery of physical solid substances, called quasicrystals, exhibiting such features [26, 38]; and on the other hand, due to intrinsic mathematical interest in describing the very border between crystallinity and aperiodicity. While there is no axiomatic framework for aperiodic order, various types of order conditions have been studied, see [1, 2, 13, 16, 24, 25, 28,29,30,31] and references therein. In particular, through the work of Durand [13], and Lagarias and Pleasants [31] it has become apparent that key features of aperiodic minimal subshifts (and their higherdimensional analogues) to be studied are linearly repetitive, repulsive and power free. Generalisations and extensions of these characteristics, namely \(\alpha \)repetitive, \(\alpha \)repulsive and \(\alpha \)finite (\(\alpha \ge 1\)), were recently introduced in [22]. Indeed, we have that 1repetitive is equivalent to aperiodic and linearly repetitive, that 1repulsive implies repulsive, and that 1finite is equivalent to power free.
For \(\alpha \ge 1\), a subshift Y which is \(\alpha \)repetitive roughly means that the maximum return time (with respect to the leftshift map) of an infinite word in Y to a cylinder set \(U \subset Y\) generated by a finite word u is of the order \(u ^\alpha \); \(\alpha \)repulsive loosely means that if W is a factor of an infinite word in Y and if \(w \ne W\) is a prefix and a suffix of W, then the overlap of these two appearances of w in W is at most of the order \(w  w ^{1/\alpha }\); and \(\alpha \)finite roughly means that if n is the largest natural number such that the nfold concatenation of a finite word u is a factor of an infinite word in Y, then n is at most of the order \(u ^{\alpha 1}\).
In [22, 28], for Sturmian subshifts with slope \(\theta \) and for \(\alpha \ge 1\), it was shown that the characteristics \(\alpha \)repetitive, \(\alpha \)repulsive and \(\alpha \)finite are equivalent. Here, links between regularity of spectral metrics built from noncommutative representations (spectral triples), aperiodic behaviour of the subshift and the Diophanitine properties of \(\theta \) were obtained.
Here, we address the following question. For an arbitrary subshift and for \(\alpha \ge 1\), which of the order conditions \(\alpha \)repetitive, \(\alpha \)repulsive and \(\alpha \)finite are equivalent?
We prove that, for \(\alpha \ge 1\), a subshift is \(\alpha \)repulsive if and only if it is \(\alpha \)finite (Theorem 3.1). However, for \(\alpha > 1\), we establish that \(\alpha \)repetitive is not necessarily equivalent to \(\alpha \)repulsive, and hence, nor \(\alpha \)finite (Theorems 4.5 and 4.10). This latter result is provided by a class of subshifts stemming from Grigorchuk’s infinite 2group G – the first known group of intermediate growth introduced by Grigorchuk [17, 18] (see also [19], where a general class of groups, denoted by \(G_{\omega }\), of intermediate growth is introduced). They have been studied, for instance, by Bon [7], Grigorchuk, Lenz and Nagnibeda [20, 21], and Lenz and Sell [32]. These subshifts are determined by an infinite sequence \(l = (l_{i})_{i \in \mathbb {N}}\) of natural numbers and we refer to them as lGrigorchuk subshifts.
We show that lGrigorchuk subshifts are aperiodic and minimal (Proposition 4.4 and Corollary 4.16). Additionally, we establish necessary and sufficient conditions for these new subshifts to be \(\alpha \)repetitive and \(\alpha \)repulsive, and hence, \(\alpha \)finite (Theorems 4.5 and 4.10). More precisely, we prove that an lGrigorchuk subshift is \(\alpha \)repulsive (and hence \(\alpha \)finite) if and only if
and that an lGrigorchuk subshift is \(\alpha \)repetitive if and only if
We also obtain an explicit formula in terms of the sequence l for the complexity function of an lGrigorchuk subshift (Theorem 4.14), from which we are able to deduce that an lGrigorchuk subshift is uniquely ergodic (Corollary 4.17). Indeed, we show that there exist at most two and at least one right special word per length. We would like to emphasise that, independently, Lenz and Sell [32] have obtained an explicit formula for the repetitive and complexity functions of an lGrigorchuk subshift. Moreover, they have also computed an explicit formula for the palindromic complexity function. Further, in the case that l is the constant one sequence, results concerning the complexity function have been obtained in [20, 21].
When l is the constant one sequence, the resulting lGrigorchuk subshift is intimately related to Lysenok group presentation of Grigorchuk’s infinite 2group G. By studying this subshift, very recently [20, 21] the spectral type of the Laplacian on the Schreier graphs describing the action of Grigorchuk’s infinite 2group G on the boundary of the infinite binary rooted tree were determined and it has been shown that it is different in the isotropic and anisotropic cases. In fact, the spectrum is shown to be a Cantor set of Lebesgue measure zero in the anisotropic case, whereas it consists of one or two intervals in the isotropic case. Here (Sect. 4.1), we implicitly associate to a given lGrigorchuk subshift a group, investigating properties of such groups and if the results of [20, 21] can be extended to encompass our setting, we believe, would be a worthwhile and fruitful venture.
Outline
In the next section, we present key definitions and results concerning subshifts and define \(\alpha \)repetitive, \(\alpha \)repulsive and \(\alpha \)finite. In Sect. 3 we state and prove the equivalence of \(\alpha \)repulsive and \(\alpha \)finite for arbitrary subshifts over a finite alphabet. We conclude with Sect. 4, which is divided into five parts. The first part (Sect. 4.1) is concerned with introducing and defining lGrigorchuk subshifts as well as stating some of their basic properties. In Sects. 4.2 and 4.3 we provide necessary and sufficient conditions on a sequence l which ensures that the associated lGrigorchuk subshift is \(\alpha \)repulsive (and hence \(\alpha \)finite), and \(\alpha \)repetitive respectively; after which, in Sect. 4.4, we present several examples of sequences \(l = (l_{n})_{n \in \mathbb {N}}\) for which the associated lGrigorchuk subshift is \(\alpha \)repetitive, and \(\alpha \)repulsive (and hence \(\alpha \)finite) for specific values of \(\alpha \). Here, we also show that if an lGrigorchuk subshift is \(\alpha \)repulsive and hence \(\alpha \)finite, then it is \(\alpha ^{2}\)repetitive. In our concluding part, Sect. 4.5, we obtain an explicit formula for the complexity function (in terms of the sequence l) of an lGrigorchuk subshift from which we deduce that any lGrigorchuk subshift is aperiodic and uniquely ergodic.
Preliminary definitions
Here, we review the key definitions of subshifts and define three notions of aperiodic order (\(\alpha \)repetitive, \(\alpha \)repulsive and \(\alpha \)finite, for a given \(\alpha \ge 1\)) first introduced for Sturmian subshifts in [22], and which generalise and extend the order conditions often referred to as linearly repetitive, repulsive and power free.
Subshifts
Let \({\mathscr {A}}\) denote a set of \(m \in \mathbb {N}\) symbols called the alphabet. For \(n \in \mathbb {N}\) we define \({\mathscr {A}}^{n}\) to be the set of all finite words in the alphabet \({\mathscr {A}}\) of length n, and set
where by convention \({\mathscr {A}}^{0}\) is the set containing only the empty word \(\varepsilon \). We denote by \({\mathscr {A}}^{\mathbb {N}}\) the set of all infinite words over the alphabet \({\mathscr {A}}\) and equip it with the discrete product topology. The continuous map \(\sigma :{\mathscr {A}}^{\mathbb {N}} \rightarrow {\mathscr {A}}^{\mathbb {N}}\) defined by \(\sigma ( x_{1}, x_{2}, \dots ) := ( x_{2}, x_{3}, \dots )\) is called the leftshift. A closed set \(Y \subseteq {\mathscr {A}}^{\mathbb {N}}\) which is leftshift invariant (that is \(\sigma (Y) = Y\)) is referred to as a subshift and the tuple \((Y, \sigma )\) forms a dynamical system. For an infinite word \(x = (x_{n})_{n \in \mathbb {N}}\) over a finite alphabet \({\mathscr {A}}\), we set
where the closure is taken with respect to the discrete product topology. We call \(\Omega (x)\) the subshift generated by x. For a subshift Y, the dynamical system \((Y, \sigma )\) is called minimal if for all \(y \in Y\) the set \(\Omega (y)\) is dense in Y. If Y does not contain a periodic element (that is, an element y, such that there exists \(k \in \mathbb {N}\) with \(\sigma ^{k}(y) = y\)), then we call Y aperiodic.
For \(w = (w_{1}, \dots , w_{k})\) and \(v = (v_{1}, \dots , v_{n}) \in {\mathscr {A}}^{*}\), we set \(w v := (w_{1}, \dots , w_{k}, v_{1}, \dots , v_{n})\), that is the concatenation of w and v. For \(m \in \mathbb {N}\), we denote by \(v^{m}\) the mfold concatenation of v with itself, namely
Note that \({\mathscr {A}}^{*}\) together with the operation of concatenation defines a monoid with identity element \(\varepsilon \). The length of v is denoted by \(v \) with \(\varepsilon =0\) and, for \(k \le n\) a natural number, we set \(v_{k} := (v_{1}, v_{2}, \dots , v_{k})\). We say that a word \(u \in {\mathscr {A}}^{*}\) is a factor of v if there exists an integer j with \(u = \sigma ^{j1}(v)_{u }\). We use the same notations when v is an infinite word. The integer j is referred to as an occurrence of u in v.
An infinite word x over a finite alphabet \({\mathscr {A}}\) is called recurrent if every factor has infinitely many different occurrences in x. A gap of a factor u of x is an integer k which is a difference between two successive occurrences of u in x. We say that x is uniformly recurrent if x is recurrent and for each factor u of x there exists an upper bound for the corresponding gaps. This is equivalent to the minimality of the corresponding subshift generated by x, see for instance [6].
The language \({\mathcal {L}}(Y)\) of a subshift Y is the set of all factors of the elements of Y. Similarly, we define the language \({\mathcal {L}}(x)\) of an infinite word x to be the set of all factors of x. Notice, the language of \(\Omega (x)\) of an infinite word x is equal to the language of x, namely \({\mathcal {L}}(\Omega (\nu )) = {\mathcal {L}}(\nu )\). Following convention, the empty word \(\varepsilon \) is assumed to be contained in every language. For \(s \ge 2\), we call \(w = (w_{1}, \dots , w_{k}) \in {\mathcal {L}}(Y)\) sright special if the cardinality of the set \(\{ a \in {\mathscr {A}} :(w_{1}, \dots , w_{k}, a) \in {\mathcal {L}}(Y) \}\) is equal to s. A word is called right special if it is sright special for some \(s \ge 2\).
Notions of aperiodic order
We begin by stating the definition of \(\alpha \)repetitive, first defined in [22] for Sturmian subshifts, which generalises the concept of linearly repetitive.
Definition 2.1
The repetitive function \(R :\mathbb {N} \rightarrow \mathbb {N}\) of a subshift Y assigns to r the smallest \(r'\) such that any element of \({\mathcal {L}}(Y)\) with length \(r'\) contains (as factors) all elements of \({\mathcal {L}}(Y)\) with length r.
Definition 2.2
Let \(\alpha \ge 1\) be given and set
A subshift Y is called \(\alpha \)repetitive if \(R_{\alpha }\) is finite and nonzero.
Remark 2.3
If \(1 \le \alpha < \beta \) and \(0< R_{\beta } < \infty \), then \(R_{\alpha } = \infty \). Similarly, if \(0< R_{\alpha } < \infty \), then \(R_{\beta } = 0\). Also, recall that a subshift Y is said to be linearly repetitive, if and only if, there exists a positive constant K, such that \(R(n) \le K n\), for all \(n \in \mathbb {N}\). Since aperiodicity of a subshift guarantees that the number of words of length n is strictly greater than n, for all \(n\in \mathbb {N}\), see for instance [15], this yields that linearly repetitive and 1repetitive are equivalent for aperiodic subshifts.
Next, for \(\alpha \ge 1\), we state the definition of \(\alpha \)repulsive, which generalises the notion of repulsive. We recall that a subshift Y is called repulsive if the value
is nonzero.
Definition 2.4
Let \(\alpha \ge 1\) be given. For a subshift Y set
where for a given natural number \(n \ge 2\)
and if \(\ell _{\alpha }\) is finite and nonzero, then we say that Y is \(\alpha \)repulsive.
Remark 2.5
Notice that, if \(1 \le \alpha < \beta \) and \(0< \ell _{\beta } < \infty \), then \(\ell _{\alpha } = 0\). Similarly, if \(0< \ell _{\alpha } < \infty \), then \(\ell _{\beta } = \infty \).
The next definition is a generalisation of the notion of a subshift being power free. If \(\alpha = 1\), then 1finite is equivalent to the property of being power free.
Definition 2.6
For a subshift Y and for \(n \in \mathbb {N}\) set
Let \(\alpha \ge 1\) be given. We say that the subshift Y is \(\alpha \)finite if the value
is nonzero and finite. Also, for ease of notation, for a given word \(v \in {\mathcal {L}}(Y)\), we let Q(v) denote the largest integer p such that \(v^{p} \in {\mathcal {L}}(Y)\), in the case that no such p exists, we set \(Q(v) = \infty \).
Remark 2.7
If \(1 \le \alpha < \beta \) and \(0< Q_{\beta } < \infty \), then \(Q_{\alpha } = \infty \). Similarly, if \(0< Q_{\alpha } < \infty \), then \(Q_{\beta } = 0\).
To conclude this section, we state the definition of the complexity function.
Definition 2.8
For a subshift Y, we define the complexity function \(p :\mathbb {N} \rightarrow \mathbb {N}\) of Y by
General results
Theorem 3.1
For \(\alpha \ge 1\) and x an infinite word over a finite alphabet, we have that \(\Omega (x)\) is \(\alpha \)repulsive if and only if it is \(\alpha \)finite.
Proof
Let \(\alpha \ge 1\) be fixed and let \(\Omega (x)\) be \(\alpha \)repulsive. Suppose that \(Q_{\alpha } = \infty \). In this case there exist sequences of natural numbers \((n_{k})_{k \in \mathbb {N}}\) and \((p_{k})_{k \in \mathbb {N}}\) satisfying

(i)
\((n_{k})_{k \in \mathbb {N}}\) is increasing with \(p_{k}n_{k}^{1  \alpha } > k\), and

(ii)
there exists \(W_{(k)} \in {\mathcal {L}}(x)\) with \(W_{(k)} = n_{k}\) and \(W_{(k)}^{p_{k}} \in {\mathcal {L}}(x)\).
Thus, we have that \(p_{k} > 1\), for all k sufficiently large. Since \(W_{(k)}^{p_{k}1}\) is a prefix and a suffix of \(W_{(k)}^{p_{k}}\) we have that
for all k sufficiently large. Therefore, we have that \(\ell _\alpha =0\).
Suppose that \(Q_{\alpha } = 0\). For \(n \in \mathbb {N}\) let \(V_{(n)}, v_{(n)} \in {\mathcal {L}}(x)\) be such that \(V_{(n)} = n\), \(v_{(n)} \ne V_{(n)}\) is a prefix and suffix of \(V_{(n)}\) and
Since \(0< \ell _\alpha < \infty \), this means that there exists a sequence \((n_{k})_{k \in \mathbb {N}}\) of natural numbers such that \(2 v_{(n_{k})} > V_{(n_k)} \), for all \(k \in \mathbb {N}\). Thus, for each \(k \in \mathbb {N}\), there exists a \(q_{k} \ge 2\) such that
where \(u_{({k})}, z_{({k})} \in {\mathcal {L}}(x)\) with \(0< z_{(k)} < u_{(k)} \). Hence, it follows that
where the lengths of the \(u_{(k)}\) are unbounded, as otherwise \(\limsup _{k\rightarrow \infty } Q(u_{(k)}) = \infty \). However, since by assumption \(Q_{\alpha } =0\), we have
This together with (1) yields that \(\ell _{\alpha } = \infty \).
The reverse direction follows from the proof of (3) \(\Rightarrow \) (2) in [22, Theorem 3.4]. We note that the statement of [22, Theorem 3.4] is in terms of Sturmian subshifts and it is assumed that \(\alpha > 1\), however, the proof of (3) \(\Rightarrow \) (2) holds for arbitrary subshifts and for \(\alpha =1\). \(\square \)
Proposition 3.2
Let \(\alpha \ge 1\) be given and let x denote an infinite word over a finite alphabet. If \(\Omega (x)\) is \(\alpha \)repulsive, or equivalently \(\alpha \)finite, then it is aperiodic.
Proof
We show the contrapositive. Suppose that there exists a \(y \in \Omega (x)\) such that \(\sigma ^{k}(y) = y\), for some \(k \in \mathbb {N}\). This implies that \(Q( n k ) = \infty \), for all \(n \in \mathbb {N}\), and so, for all \(\alpha \ge 1\) we have that \(Q_\alpha = \infty \). Therefore, the subshift \(\Omega (x)\) is not \(\alpha \)finite for any \(\alpha \ge 1\). \(\square \)
Proposition 3.3
For an aperiodic subshift Y we have that \(R(n) > n Q(n)\), for all \(n\in \mathbb {N}\).
Proof
Recall that aperiodicity of a subshift guarantees that the number of words of length n is strictly greater than n, for all \(n\in \mathbb {N}\), see for instance [15].
Let \(n \in \mathbb {N}\) be fixed. Let \(w \in {\mathcal {L}}(Y)\) be such that \(w = n\) and \(w^{Q(n)} \in {\mathcal {L}}(Y)\). The word \(w^{Q(n)}\) has at most n different factors of length n. Thus, since \(w^{Q(n)} = n Q(n)\) and since \({\mathcal {L}}(Y)\) is aperiodic, we have that \(R(n) > n Q(n)\). \(\square \)
Corollary 3.4
For an aperiodic subshift Y and for \(\alpha \ge 1\), we have that \(R_{\alpha } \ge Q_{\alpha }\). In particular, \(R_{\alpha } = 0\) implies \(Q_{\alpha } = 0\) and \(Q_{\alpha } = \infty \) implies \(R_{\alpha } = \infty \).
Remark 3.5
In general it is not true that if \(Q_{\alpha } = 0\), then \(R_{\alpha } = 0\) and if \(R_{\alpha } = \infty \), then \(Q_{\alpha } = \infty \). An infinite word x in which one of the letters only occurs exactly once gives rise to a subshift \(\Omega (x)\) where this occurs. However, this subshift is not minimal. The lGrigorchuk subshifts (which we will shortly introduce in the next section) provide examples of uniquely ergodic and minimal subshifts which are \(\alpha \)finite (or equivalently \(\alpha \)repulsive), but not \(\alpha \)repetitive, see Example 4.12.
lGrigorchuk subshifts
\({\varvec{l}}\)Grigorchuk subshifts
The Grigorchuk subshift is a subshift associated to Grigorchuk’s infinite 2group G. The group G was originally introduced in [17, 18] and is an infinite finitely generated torsion group and so belongs to the class of Burnside groups, see also [19]. It has growth between polynomial and exponential, hence is amenable but not elementary amenable, see [19]. This group therefore provided simultaneous answers to the question of Milnor [34] on existence of groups of intermediate growth, and to the question of Day [12] on existence of amenable but not elementary amenable groups. Lysenok [33], gave a recursive presentation of G by generators and relations using a homomorphism \(\kappa \), which we will shortly define, see (2) and (6). It is remarkable that the homomorphism \(\kappa \) serves not only to define G algebraically, but also, as is shown in [20], to describe spectral properties of G and to determine G in terms of topological dynamics as a subgroup of the topological full group of a minimal Cantor system.
Following convention we consider the alphabet \(\{ a, x, y, z \}\). We define the semigroup homomorphism \(\kappa :\{ a, x, y, z \}^{*} \rightarrow \{ a, x, y, z \}^{*}\) by
and for a finite word \(w = (w_{1}, \dots , w_{n})\) we set \(\kappa (w) := \kappa (w_{1}) \dots , \kappa (w_{n})\). The homomorphism \(\kappa \) is defined to act on infinite words analogously. It is known that there exists a unique infinite word \(\eta \in \{ a, x, y, z \}^{\mathbb {N}}\) such that \(\kappa (\eta ) = \eta \), see for instance [20]. We call the subshift \(\Omega (\eta )\) the Grigorchuk subshift. Alternatively, this subshift can be generated by the three semigroup homomorphisms \(\tau _{x}\), \(\tau _{y}\) and \(\tau _{z}\) defined by
where \(\beta \in \{ x, y, z \}\), and for \(w = (w_{1}, \dots , w_{n})\) we set \(\tau _{\beta }(w) := {\tau }_{\beta }(w_{1}), \dots , {\tau }_{\beta }(w_{n})\). Indeed, the word \(\eta \) is the unique word with the prefix
for all \(n \in \mathbb {N}\). We now introduce a more general class of subshifts based on this latter construction, which we call lGrigorchuk subshifts, where each \(l = (l_{k})_{k \in \mathbb {N}}\) is a sequence of natural numbers.
Let \(l = (l_{k})_{k \in \mathbb {N}}\) denote a fixed sequence of natural numbers. For \(j \in \mathbb {N}\), we denote by N(j) and q(j) the unique integers such that
We define \(\tau ^{(j)}\) by
and let \(\tau ^{(0)}\) be the identity. Additionally, we set
Proposition 4.1
For \(l=(l_k)_{k \in \mathbb {N}}\), there exists a unique infinite word \(\eta _{l}\) with prefix \(\tau ^{(j)}(a)\), for all \(j \in \mathbb {N}_{0}\).
Proof
This is a consequence of the fact that, \(\tau ^{(j)}(a)\) is a prefix of \(\tau ^{(j+1)}(a)\), for all \(j \in \mathbb {N}_{0}\), and, as we will see in Proposition 4.2, \(\lim _{j \rightarrow \infty } \tau ^{(j)}(a) = \infty \). \(\square \)
For a given sequence of natural numbers \(l = (l_{k})_{k \in \mathbb {N}}\), we refer to the subshift \(\Omega (\eta _{l})\) as the lGrigorchuk subshift, where \(\eta _{l}\) is the unique word given in Proposition 4.1. When it is clear from the context, we will write \(\eta \) instead of \(\eta _{l}\). Note that the Grigorchuk subshift is an lGrigorchuk subshift with l equal to the constant one sequence, namely \(l = (1, 1, 1, \dots )\). By construction, for all \(j \in \mathbb {N}\), we observe that \(\eta \) has the form
where the letters x, y and z occur infinitely often, in a prescribed order determined by the sequence l, in place of the question marks. One can also define an lGrigorchuk subshift where elements of l are allowed to take the value zero, see Remark 4.18.
Proposition 4.2
For \(j \in \mathbb {N}_{0}\) we have that \(\displaystyle \tau ^{j}(a) \vert = 2^{j + 1}  1\).
Proof
We have that \(\tau ^{(0)}(a) = a = 1\). Suppose the result holds true for some \(j \in \mathbb {N}_{0}\), then
This completes the proof. \(\square \)
Corollary 4.3
An lGrigorchuk subshift is repulsive if and only if it is 1repulsive.
Proof
For an lGrigorchuk subshift, we observe that since \(\tau ^{(j)}(a)\) is a prefix and suffix of \(\tau ^{(j+1)}(a)\) and since \(\tau ^{(j)}(a) \in {\mathcal {L}}(\eta )\), for \(j \in \mathbb {N}\), by Proposition 4.2 we have \(Q_{1} \le 1\). Therefore, an lGrigorchuk subshift is repulsive if and only if it is 1repulsive. \(\square \)
Proposition 4.4
An lGrigorchuk subshift is minimal.
Proof
For every word w in the language of \(\eta \) there exists a \(j \in \mathbb {N}\) such that w is a factor of \(\tau ^{(j)}(a)\). The structure of \(\eta \), namely that given in (5), yields that the gap between two successive occurrences of w’s is bounded, and so, \(\eta \) is uniformly recurrent. As uniform recurrence is equivalent to minimality, see for instance [6], this completes the proof. \(\square \)
While we do not use it in the sequel we would like to highlight the role \(\kappa \) and \(\tau ^{(j)}\), and hence \(\tau _{x}\), \(\tau _{y}\) and \(\tau _{z}\), play in Grigorchuk’s infinite 2group G. Indeed, \(\kappa \) is (a version of) the substitution used by Lysenok [33] to obtain a presentation of G. More specifically, [33] shows that
This presentation can be written using \(\tau ^{(j)}\), and hence \(\tau _{x}\), \(\tau _{y}\) and \(\tau _{z}\), by using the fact that
and that, for all \(j \in \mathbb {N}\),
Here \(\tau ^{(j)}\) and \(\beta ^{(j)}\) are as defined in (3) and (4) with l equal to the constant 1 sequence, that is \(l = (l_{i})\) with \(l_{i} = 1\).
\(\varvec{\alpha }\)Finite and \(\varvec{\alpha }\)repulsive
Theorem 4.5 below gives a necessary and sufficient condition on a given sequence of natural numbers l to guarantee that the associated lGrigorchuk subshift is \(\alpha \)finite, which by Theorem 3.1 is equivalent to the subshift being \(\alpha \)repulsive. In particular, we obtain that an lGrigorchuk subshift is 1finite (and hence 1repulsive) if and only if l is a bounded sequence. Thus, as 1repulsive implies repulsive, if l is a bounded sequence, then the associated lGrigorchuk subshift is repulsive.
Theorem 4.5
For \(\alpha \ge 1\) the following three statements are equivalent.

(i)
An lGrigorchuk subshift is \(\alpha \)repulsive.

(ii)
An lGrigorchuk subshift is \(\alpha \)finite.

(iii)
\(\limsup _{n \rightarrow \infty } l_{n+1} + (1  \alpha ) \sum _{i = 1}^{n} l_{i} <\infty \).
Proof
The result follows from Theorems 3.1 and 4.6 given below. \(\square \)
Theorem 4.6
For \(\alpha > 1\), an lGrigorchuk subshift fulfils the following equality.
Moreover, we have that
For the proof of this result we will require the following definition and remark.
Definition 4.7
Fix a sequence \(l = (l_{i})_{i \in \mathbb {N}}\) and let \(\eta \) denote the unique infinite word given by Proposition 4.1. For \(j \in \mathbb {N}\), define \(\eta ^{(j)}\) to be the infinite word associated to the sequence
given by Proposition 4.1.
Remark 4.8
Let \((l_{i})_{i \in \mathbb {N}}\) be a sequence of natural numbers. The (generalised) Grigorchuk subshifts associated to the sequences \((0, 0, \dots , 0, l_{1}, l_{2}, l_{3}, \dots )\) and \((l_{1}, l_{2}, l_{3}, \dots )\) are topologically conjugate through the semigroup homomorphism which maps a to a and applies a cyclic permutation to \(\{ x, y, z \}\).
Proof of Theorem 4.6
We structure the proof as follows. We prove the following five statements from which we will deduce the required result.

(i)
\(Q(2) = 2^{l_{1} +1} 1\)

(ii)
If \(k \in \mathbb {N}\) is such that \(k \equiv 1 \pmod {4}\) or \(k \equiv 3 \pmod {4}\), then \(Q(k) = 1\).

(iii)
If \(k \in \mathbb {N}\) is such that \(k \equiv 2 \pmod {4}\) and \(\eta _{k} \eta _{k} \in {\mathcal {L}}(\eta )\), then \(\displaystyle Q(\eta _{k}) = \lfloor (2^{l_{1} + 2}  2)/ k \rfloor \).

(iv)
If \(k \in \mathbb {N}\) is such that \(k \equiv 0 \pmod {4}\) and \(\eta _{k} \eta _{k} \in {\mathcal {L}}(\eta )\), then
$$\begin{aligned} Q(\eta _{k}) = \left\lfloor \frac{2^{l_{N(j)}q(j) + 1}1}{k/2^{j+1}} \right\rfloor , \end{aligned}$$(7)where j is the smallest integer such that \(k/2^{j} \equiv 2 \pmod {4}\).

(v)
Let \(n \in \mathbb {N}\) and let \(0 \le r < 2^{n}\). For each \(v = (v_{1}, v_{2}, \dots , v_{2^{n} + r} )\in {\mathcal {L}}(\eta )\) with \(Q(v) \ge 3\), there exists \(1 \le k \le 2^{n} + r\) such that \(\eta _{2^n+r} = (v_{k}, \ldots , v_{2^n+r}, v_{1}, \ldots ,v_{k1})\) and, moreover, \(Q(v)  1 \le Q(\eta _{2^n+r}) \le Q(v)\).
To prove Statement (i), notice that (y, a, y) and (z, a, z) are not factors of \(\eta \). This follows, since each \((4k + 2)\)th letter of \(\eta \) is equal to x, for all \(k \in \mathbb {N}_{0}\). By definition, we have that \(\eta = \tau _{x}^{l_{1}} ( \eta ^{(l_{1})})\). Since the \((4k + 2)\)th letter of \(\eta ^{(l_{1})}\) is equal to y, for all \(k \in \mathbb {N}_{0}\), it follows that (x, a, x) is not a factor of \(\eta ^{(l_{1})}\), and hence, by Proposition 4.2,
Since every second letter of \(\eta \) is equal to a, it follows that if \(n \equiv 1 \pmod {2}\), then \(Q(n) = 1\).
Assume that the conditions of Statement (iii) hold, that is \(k = 2^{n} + r \equiv 2 \pmod {4}\), where \(n \in \mathbb {N}\) and \(0 \le r < 2^{n}\). By construction we have that \(\eta _{i} = x\) for all \(i \equiv 2 \pmod {4}\). Thus,
Since \(\eta _{k} \eta _{k} \in {\mathcal {L}}(\eta )\), we have that \(\eta _{k} = (a, x)^{k/2}\). This in tandem with Statement (i) yields that
For Statement (iv), notice that for all \(j \in \mathbb {N}\) with \(k\equiv 0 \pmod {2^{j}}\), we have
Since \(\tau ^{(j)}\) is a semigroup homomorphism on \(\{a,x,y,z\}^{*}\), it follows that \(Q(\eta _{k}) = Q(\eta ^{(j)}_{k\vert 2^{j}})\). (Note here that \(Q(\eta _{k})\) is taken with respect to the language \({\mathcal {L}}(\eta )\) and \(Q(\eta ^{(j)}_{k/2^{j}})\) is taken with respect to the language \({\mathcal {L}}(\eta ^{(j)})\)). This in tandem with Remark 4.8 and Statement (iii) yields that
where j is the smallest integer such that \(k/2^{j} \equiv 2 \pmod {4}\).
We now turn to the proof of Statement (v). By Statement (ii) it is sufficient to consider words of even length. To this end, let \(v \in {\mathcal {L}}(\eta )\) with \(Q(v) \ge 3\) and with \(v = 2^{n}+r\), for some \(n\in \mathbb {N}\), and \(0 \le r < 2^{n}\). Due to the structure of \(\eta \) given in (5), where we set \(j = n 1\), and since every \((2m + 1)\)th question mark in (5) is equal to \(\beta ^{(j)}\), for all \(m \in \mathbb {N}_{0}\), we have that \(\tau ^{(j)}((a, \beta ^{(j)}))\) is a factor of \(v^{Q(v)}\). Thus there exists a natural number \(k \le 2^{n} + r\) such that
see (8), which yields that \(Q(v)1 \le Q(\eta _{2^{n}+r}) \le Q(v)\).
With Statements (i), (ii), (iii), (iv) and (v) at hand we can now prove the required result. If \(k \equiv 0 \pmod {4}\), then the left hand side of (7) is maximised on the set \([2^{n}, 2^{n+1}) \cap \mathbb {N}\), at \(j = n 1\), namely when \(k = 2^{n}\). Further, (7) in tandem with (5) and Proposition 4.2, yields
The function \(n \mapsto Q(\eta _{2^{n}})\) is maximised on the set \([\sum _{i = 1}^{m} l_{i}, \sum _{i=1}^{m+1} l_{i}) \cap \mathbb {N}\) when \(n  1 = \sum _{i = 1}^{m} l_{i}\). Indeed, we have that
where \(k = 2^{1 + \sum _{i = 1}^{m} l_{i}}\). Hence,
Here the first inequality follows from (9); the second inequality follows from the latter results of Statement (v); the last inequality follows from Statements (i), (ii), (iii), (iv) together with (9). \(\square \)
Corollary 4.9
An lGrigorchuk subshift satisfies \(Q(2^{j + 1}) = 2^{l_{N(j)}  q(j) + 1}  1\), for all \(j \in \mathbb {N}\).
Proof
The result follows from (5), Proposition 4.2 and Statement (iv) in the proof of Theorem 4.6 together with an argument by contradiction. \(\square \)
\(\varvec{\alpha }\)Repetitive
Our next result gives a necessary and sufficient condition on a given sequence of natural numbers \(l = (l_{i})_{i = 1}^{\infty }\) to guarantee that the associated lGrigorchuk subshift is \(\alpha \)repetitive. In particular, we obtain that an lGrigorchuk subshift is 1repetitive if and only if l is a bounded sequence. Thus, as 1repetitive implies linearly repetitive, if l is a bounded sequence, then the associated lGrigorchuk subshift is linearly repetitive. We would also like to mention here that an exact formula for the repetitive function of an lGrigorchuk subshift has been obtained, independently, in [32], and hence they have also obtained a criterion similar to ours for an lGrigorchuk subshift to be \(\alpha \)repetitive.
Theorem 4.10
For \(\alpha \ge 1\) an lGrigorchuk subshift is \(\alpha \)repetitive if and only if
We prove Theorem 4.10 by using the following bounds on the repetitive function.
Lemma 4.11
Let \(l = (l_{i})_{i \in \mathbb {N}}\) denote a sequence of natural numbers. The repetitive function for an lGrigorchuk subshift satisfies the following inequalities, for \(j \in \mathbb {N}\),
Proof
By (5) we have that \(\tau ^{(j1)} \circ \tau _{x} (a)\), \(\tau ^{(j1)} \circ \tau _{y} (a)\) and \(\tau ^{(j1)} \circ \tau _{z} (a)\) all belong to \({\mathcal {L}}(\eta )\) and that
We claim that, for all \(k \in \{ 1, 2, \dots , l_{N(j)}  q(j)\}\), the word
does not contain as factors both the words
For if this were the case, then, since the first letter of the words in (10) is equal to a and both \(\tau ^{(j1)}(a)\) and \(\tau ^{(j)}(a)\) are palindromes, there exists an integer \(m \in [2^{j1}+1, 2^{j}1]\) with
or, such that
Thus, the \((2^{j+1}2m)\)th letter of \(\tau ^{(j1)}(a)\) is equal to \(\beta ^{(j)}\) and the \((2m  2^{j})\)th letter of \(\tau ^{(j1)}(a)\) is equal to \(\beta ^{(j + l_{N(j)}  q(j))}\) in the case of (11) and \(\beta ^{(j + l_{N(j)}  q(j) + l_{N(j) + 1})}\) in the case of (12). As \(\tau ^{(j1)}(a)\) is a palindrome, \(\beta ^{(j)} \ne \beta ^{(j + l_{N(j)}  q(j))}\) and \(\beta ^{(j)} \ne \beta ^{(j + l_{N(j)}  q(j)+ l_{N(j) + 1})}\), this yields a contradiction to the initial assumption.
Similarly, for all \(k \in \{1, 2, \dots , l_{N(j)+1} \}\), the word
does not contain as a factor the word
This yields the lower bound for the repetitive function, namely that
Due to the structure of \(\eta \), given a word of length \(2^{j+1}1\) in \({\mathcal {L}}(\eta )\) it is necessarily a factor of \(\tau ^{(j)} \circ \tau _{x}(a)\), \(\tau ^{(j)} \circ \tau _{y}(a)\) or \(\tau ^{(j)} \circ \tau _{z}(a)\). Thus, any word of length \(2^{j+1}1\) is a factor of
This in tandem with (5) and Proposition 4.2 yields that
which completes the proof. \(\square \)
Proof of Theorem 4.10
For \(n \in \mathbb {N}\), let \(j = j(n)\) denote the unique natural number such that \(2^{j  1} \le n < 2^{j}\). By definition, the repetitive function is monotonically increasing, and so \(R(2^{j1}  1) \le R(n) \le R(2^{j}  1)\). Combining this with Lemma 4.11, yields that
Since
we have that \(0< R_{\alpha } < \infty \), if and only if,
This completes the proof. \(\square \)
Examples
Here we discuss several examples of sequences \(l = (l_{n})_{n \in \mathbb {N}}\) for which the associated lGrigorchuk subshift exhibits difference order characteristics.
Example 4.12

(i)
If l is a bounded sequence, then the associated lGrigorchuk subshift is 1repetitive and 1repulsive, and hence, 1finite.

(ii)
Let \(b \ge 2\) denote a fixed integer. If \(l = ( b^{n} )_{n \in \mathbb {N}}\), then the associated lGrigorchuk subshift is \(b^{2}\)repetitive, and brepulsive (and hence bfinite). Thus, in general, \(\alpha \)repetitive is not equivalent to \(\alpha \)repulsive, and hence nor \(\alpha \)finite.

(iii)
Let \(( b_{n} )_{n \in \mathbb {N}}\) denote a bounded sequence, and set \(l_{n} = 2^{n/2}  b_{n/2}\) if n is even, and set \(l_{n} = b_{(n+1)/2}\) otherwise. The associated lGrigorchuk subshift is 2repetitive, however, it is not \(\alpha \)repulsive nor \(\alpha \)finite, for any value of \(\alpha \ge 1\).

(iv)
Let \(l_{n} = 2^{n/2}n\) if n is even and \(l_{n} = n\) otherwise. The associated lGrigorchuk subshift is neither \(\alpha \)repetitive, \(\alpha \)repulsive nor \(\alpha \)finite for any value of \(\alpha \ge 1\).

(v)
If \(l = (l_{n})_{n \in \mathbb {N}}\) is a sequence of natural number such that there exists a nonconstant polynomial P with \( l_{n}=P(n)\), then the lGrigorchuk subshift is neither \(\alpha \)repulsive, \(\alpha \)finite nor \(\alpha \)repetitive, for any value of \(\alpha \ge 1\). This is a consequence of Faulhalber’s formula [9].
From Example 4.12 (ii) and (iii), for \(\alpha > 1\), we see that the lGrigorchuk subshifts provide examples which demonstrate that \(\alpha \)repulsive, and hence \(\alpha \)finite, is not equivalent to \(\alpha \)repetitive. This gives rise to the question how the notions of \(\alpha \)repetitive and \(\beta \)repulsive, and hence \(\beta \)finite, are connected in terms of lGrigorchuk subshifts. This is what we address in the following proposition; indeed the connection, which we have observed in Example 4.12 (i) and (ii) is in fact true in general.
Proposition 4.13
Let l be a sequence of natural numbers. If the lGrigorchuk subshift is \(\alpha \)repulsive, and hence \(\alpha \)finite, then it is \(\alpha ^2\)repetitive.
Proof
Observe that, for all \(n \in \mathbb {N}\),
By the hypothesis and Theorem 4.5, we have that \(\limsup _{n \rightarrow \infty } l_{n+1} + (1  \alpha ) \sum _{i = 1}^{n} l_{i} \) is a finite real number. In the following, we denote this value by c. Given \(\epsilon >0\), there exists an \(N \in \mathbb {N}\), such that, for all \(n\ge N\),
This in tandem with Eq. 13 yields for \(\delta \ge 1\) that
for all \(n\ge N\). This in combination with the hypothesis of the proposition and the Theorems 4.5 and 4.10 yields the required result. \(\square \)
Aperiodicity, complexity and ergodicity
We now turn to computing the value of the complexity function for a given lGrigorchuk subshift. Knowing the behaviour of the complexity function allows us to conclude that any lGrigorchuk subshift is aperiodic and uniquely ergodic. We note that in [32] an explicit formula for the complexity and the palindromic complexity functions have also been obtained independently. The proof of the following theorem is a generalisation of that given in [20, 21], where the case when l is the constant one sequence is considered.
In the sequel, for ease of notation, for \(n \in \mathbb {N}_{0}\), we set \(M(n):= \tau ^{(\sum _{i=1}^{n} l_i )} (a) =2^{1+\sum _{i=1}^{n} l_i }1\).
Theorem 4.14
For \(m \in \mathbb {N}_{0}\) and \(0 \le r < M({m+1})  M(m)\), the lGrigorchuk subshift satisfies,
For the proof of this result we will use the following lemma.
Lemma 4.15
The factor \(\tau ^{(j)}(a)\) is 3special for every \(j\in \mathbb {N}_0\).
Proof
This follows from the structure of \(\eta \) given in (5). \(\square \)
Proof of Theorem 4.14
For \(m=1\), every word of length \(\tau ^{( l_{1} )}(a) + 1\) in \({\mathcal {L}}(\eta )\) is a factor of at least one of the following words belonging to \({\mathcal {L}}(\eta )\).
This yields that \(p( \tau ^{(l_1) }(a) + 1)=2 \tau ^{(l_1)}(a) + \tau ^{(0)}(a) \). In the same way, for a fixed \(m \in \mathbb {N}\), every word of length \(\tau ^{(\sum _{i=1}^{m} l_i )}(a) + 1\) in \({\mathcal {L}}(\eta )\) is a factor of at least one of the following words
which are all contained in \({\mathcal {L}}(\eta )\) by (5). Additionally, we have
With this we obtain that, for all \(m\in \mathbb {N}\),
By Lemma 4.15 the factor \(\tau ^{(\sum _{i=1}^{m} l_i )}(a)\) is 3right special, for all \(m\in \mathbb {N}\), and so
is 3right special as it is a suffix of \(\tau ^{(\sum _{i=1}^{m+1} l_i )}(a)\). Notice that
has the same length as \(\tau ^{(1+\sum _{i=1}^{m} l_i )}(a)\), but it is not right special because, by (5), the only possible rightextension is
However, due to the structure of \(\eta \) given in Proposition 4.1 and (5), the prefix
whose length is equal to \(2 \tau ^{(\sum _{i=1}^{m} l_i )}(a) \tau ^{(\sum _{i=1}^{m1} l_i )}(a)\), is 2right special. Further, it is not a suffix of \(\tau ^{(\sum _{i=1}^{m+1} l_i )}(a)\). Using these right special words and their respective suffixes of length strictly greater than \(\tau ^{(\sum _{i=1}^{m} l_i )}(a) \) we obtain that
The result follows by combining (14) and (15) together with an inductive argument. \(\square \)
Corollary 4.16
Every lGrigorchuk subshift is aperiodic.
Proof
By Proposition 4.4 we know that every lGrigorchuk subshift is minimal. Therefore, if an lGrigorchuk subshift was not aperiodic, then its complexity function would be bounded, contradicting Theorem 4.14. \(\square \)
Corollary 4.17
Every lGrigorchuk subshift is uniquely ergodic.
Proof
Given an lGrigorchuk subshift \(\Omega (\eta )\) we define the associated twosided subshift \(\Omega '(\eta )\) by \(\Omega '(\eta ) := \{ \omega \in \{ a, x, y, z \}^{\mathbb {Z}} :{\mathcal {L}}(\omega ) \subseteq {\mathcal {L}}(\eta ) \}\). Here \(\{ a, x, y, z \}^{\mathbb {Z}}\) denotes the set of all biinfinite words over the alphabet \(\{ a, x, y, z \}\) equipped with the discrete product topology. Since \(\eta \) is uniformly recurrent (see Proposition 4.4), we have that \(\Omega '(\eta )\) is minimal. (For the latter result, see for instance [6].) The existence of an invariant measure supported on \(\Omega '(\eta )\) is guaranteed by [8]. By Lemma 4.15 and Theorem 4.14 and [8, Theorem 2.2], where in this latter result we set \(\alpha = 4\) and \(k = 1\), it follows that \(\Omega '(\eta )\) has at most one ergodic measure \(\mu \). Therefore, \((\Omega '(\eta ),\sigma )\) is a uniquely ergodic dynamical system. Since as a dynamical system, \((\Omega (\eta ),\sigma )\) is a topological factor of \((\Omega '(\eta ),\sigma )\) via the factor map \(\pi :\Omega '(\eta )\rightarrow \Omega (\eta )\) given by \(\pi (\dots , x_{2}, x_{1}, x_{0}, x_{1}, x_{2}, \dots ) = (x_{1}, x_{2}, \dots )\), it follows that also \((\Omega (\eta ),\sigma )\) is uniquely ergodic. To see this, fix a continuous function \(f:\Omega (\eta )\rightarrow \mathbb {R}\) and \(x\in \Omega (\eta )\). Then there exists \(y\in \Omega '(\eta )\) with \(x=\pi (y)\) and we have
This characterises unique ergodicity as stated e.g. in [40, Theorem 6.19]. \(\square \)
Alternatively, one can show that any lGrigorchuk subshift is a regular Toeplitz subshift, and so it is uniquely ergodic, see [23].
Remark 4.18
In most sections of this article, we assumed that \(l_i\ne 0\) for all \(i\in \mathbb {N}\). We believe that all of our results hold under slightly weaker assumptions, namely that if \(l_{i} = 0\), for some index i, then \(l_{i1}\) and \(l_{i+1}\) are nonzero, and the homomorphisms \(\tau _x\), \(\tau _y\) and \(\tau _z\) all occur infinitely often in the construction of \(\eta \).
References
Arnoux, P., Rauzy, G.: Représentation géométrique de suites de complexité \(2n+1\). Bull. Soc. Math. France 119(2), 199–215 (1991)
Baake, M., Grimm, U.: Aperiodic order: a mathematical invitation, vol. 1. In: Encyclopedia of Mathematics and Its Applications, vol. 149. Cambridge University Press, Cambridge, UK (2013)
Baake, M., Moody, R.V. (eds).: Directions in mathematical quasicrystals. CRM Monogr. Ser. 13. American Mathematical Society, Providence, RI (2000)
Berthé, V.: SAdic Expansions Related to Continued Fractions. RIMS Kyokuroku Bessatsu B58, 61–84 (2016)
Berthé, V., Delecroix, V.: Beyond Substitutive Dynamical Systems: SAdic Expansions, vol. B46 , pp. 81–123. RIMS Lecture note ‘Kokyuroku Bessatu’ (2014)
Berthe, V., Rigo, M.: Combinatorics, Automata and Number Theory, 1st edn. Cambridge University Press, New York (2010)
Bon, M.N.: Topological full groups of minimal subshifts with subgroups of intermediate growth. J. Mod. Dyn. 9, 67–80 (2015)
Boshernitzan, M.: A unique ergodicity of minimal symbolic flows with linear block growth. Anal. Math. 44, 77–96 (1984/85)
Conway, J.H., Guy, R.: The Book of Numbers. Copernicus, Germany (1995)
Damanik, D., Lenz, D.: Substitution dynamical systems: characterization of linear repetitivity and applications. J. Math. Anal. Appl. 321, 766–780 (2006)
Damanik, D., Lenz, D.: The index of sturmian sequences. Eur. J. Comb. 23(1), 23–29 (2002)
Day, M.M.: Amenable semigroups. Ill. J. Math. 1, 509–544 (1957)
Durand, F.: Linearly recurrent subshifts have a finite number of nonperiodic subshift factors. Ergod. Theory Dyn. Syst. 20, 1061–1078 (2000)
Durand, F., Host, F., Skau, C.: Substitution dynamical systems, Bratteli diagrams and dimension groups. Ergod. Theory Dyn. Syst. 19, 953–993 (1999)
Fogg, N.P.: Substitutions in dynamics, arithmetics and combinatorics. In: Berthé, V., Ferenczi, S., Mauduit, C., Siegel, A. (eds.) Lecture Notes in Mathematics, vol. 1794. Springer, Berlin (2002)
Fuhrmann, G., Gröger, M., Jäger, T.: Amorphic complexity. Nonlinearity 29(2), 528 (2016)
Grigorchuk, R.I.: On Burnside’s problem on periodic groups. Funktsional. Anal. i Prilozhen. 14, 53–54 (1980)
Grigorchuk, R.: On the Milnor problem of group growth. Soviet Math. Dokl. 1(28), 23–26 (1983)
Grigorchuk, R.: Degrees of growth of finitely generated groups and the theory of invariant means. Izv. Akad. Nauk SSSR Ser. Mat. 48, 939–985 (1984)
Grigorchuk, R., Lenz, D., Nagnibeda, T.: Schreier Graphs of Grigorchuk’s Group and a Substitution Associated to a Nonprimitive Subshift. arXiv:1510.00545 (2016) (Preprint)
Grigorchuk, R., Lenz, D., Nagnibeda, T.: Spectra of Schreier Graphs of Grigorchuk’s Group and Schroedinger Operators with Aperiodic Order. arXiv:1412.6822 (2016) (Preprint)
Gröger, M., Kesseböhmer, M., Mosbach, A., Samuel, T., Steffens, M.: A Classification of Aperiodic Order Via Spectral Metrics and Jarník Sets. arXiv:1601.06435 (2016) (Preprint)
Kůrka, P.: Topological and Symbolic Dynamics. Société Mathématique de France, Marseille, France (2003)
Haynes, A., Koivusalo, H., Walton, J.: A Characterization of Linearly Repetitive Cut and Project Sets. arXiv:1503.04091 (2015) (Preprint)
Hedlund, G.A., Morse, M.: Symbolic dynamics II: Sturmian trajectories. Am. J. Math. 62, 1–42 (1940)
Ishimasa, T., Nissen, H.U., Fukano, Y.: New ordered state between crystalline and amorphous in Ni–Cr particles. Phys. Rev. Lett. 55(5), 511–513 (1985)
Kellendonk, J., Lenz, D., Savinien, J.: A characterization of subshifts with bounded powers. Discrete Math. 313(24), 2881–2894 (2013)
Kellendonk, J., Savinien, J.: Spectral triples and characterization of aperiodic order. Proc. Lond. Math. Soc. 104, 123–157 (2012)
Lagarias, J.C.: Geometric models for quasicrystals I. Delone sets of finite type. Discrete Comput. Geom. 21(29), 161–191 (1999)
Lagarias, J.C., Pleasants, P.A.B.: Local complexity of Delone sets and crystallinity. Can. Math. Bull. 45(4), 634–652 (2002)
Lagarias, J.C., Pleasants, P.A.B.: Repetitive Delone sets and quasicrystals. Ergod. Theory Dyn. Syst. 23(3), 831–867 (2003)
Lenz, D., Sell, D.: Private communication. Analysis & Geometry and Dynamical Systems & Mathematical Physics Seminar, 7 July 2016 (2016). http://www.anageoseminars.unijena.de/Past+terms/Sommer+term+2016.html. Accessed 25 Mar 2017
Lysenok, I.G.: A set of defining relations for the Grigorchuk group. (Russian), Mat. Zametki 38, 503–516 (1985). English translation: Math. Notes 38, 784–792 (1985)
Milnor, J.: Problem 5603. Am. Math. Mon. 75, 685–686 (1968)
Moody, R.V. (ed).: The mathematics of longrange aperiodic order. In: Proceedings of the NATO Advanced Study Institute Held in Waterloo, pp. 403–441, NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci. 489. Kluwer Academic Publishers Group (1997)
Patera, J. (ed).: Quasicrystals and discrete geometry. In: Proceedings of the Fall Programme Held at the University of Toronto. Fields Inst. Monogr. 10. American Mathematical Society, Providence, RI (1998)
Savinien, J.: A metric characterisation of repulsive tilings. Discrete Comput. Geom. 54(3), 705–716 (2015)
Shechtman, D., Blech, I., Gratias, D., Cahn, J.W.: Metallic phase with longrange orientational order and no translational symmetry. Phys. Rev. Lett. 53(20), 1951–1953 (1984)
Solomyak, B.: Nonperiodicity implies unique composition for selfsimilar translationally finite tilings. Discrete Comput. Geom. 20, 265–279 (1998)
Walters, P.: An Introduction to Ergodic Theory. Graduate Texts in Mathematics. Springer, Berlin (2013)
Acknowledgements
The authors would like to thank Daniel Lenz and Daniel Sell for bringing the problem to their attention. The fourth author would like to thank AG Dynamical Systems and Geometry at Universität Bremen, Fakultät für Mathematik und Informatik at FriedrichSchillerUniversität Jena and Institut für Mathematik at Universität zu Lübeck for hosting him and providing a stimulating research environment while working on this project. The last author is grateful to the Institut für Mathematik at Universität zu Lübeck for providing a stimulating working environment during the writing of this article.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Ari Laptev.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Dreher, F., Kesseböhmer, M., Mosbach, A. et al. Regularity of aperiodic minimal subshifts. Bull. Math. Sci. 8, 413–434 (2018). https://doi.org/10.1007/s1337301701020
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s1337301701020
Keywords
 Aperiodic order
 Complexity
 Subshifts
 Grigorchuk group
 Unique ergodicity