# Regularity of aperiodic minimal subshifts

- 632 Downloads

## Abstract

At the turn of this century Durand, and Lagarias and Pleasants established that key features of minimal subshifts (and their higher-dimensional 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 2-group *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.

## Keywords

Aperiodic order Complexity Subshifts Grigorchuk group Unique ergodicity## 1 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 higher-dimensional 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 1-repetitive is equivalent to aperiodic and linearly repetitive, that 1-repulsive implies repulsive, and that 1-finite 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 left-shift 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 *n*-fold 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 2-group *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 *l*-Grigorchuk subshifts.

*l*-Grigorchuk 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

*l*-Grigorchuk subshift is \(\alpha \)-repulsive (and hence \(\alpha \)-finite) if and only if

*l*-Grigorchuk subshift is \(\alpha \)-repetitive if and only if

*l*for the complexity function of an

*l*-Grigorchuk subshift (Theorem 4.14), from which we are able to deduce that an

*l*-Grigorchuk 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

*l*-Grigorchuk 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 *l*-Grigorchuk subshift is intimately related to Lysenok group presentation of Grigorchuk’s infinite 2-group *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 2-group *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 *l*-Grigorchuk 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.

### 1.1 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 *l*-Grigorchuk 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 *l*-Grigorchuk 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 *l*-Grigorchuk subshift is \(\alpha \)-repetitive, and \(\alpha \)-repulsive (and hence \(\alpha \)-finite) for specific values of \(\alpha \). Here, we also show that if an *l*-Grigorchuk 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 *l*-Grigorchuk subshift from which we deduce that any *l*-Grigorchuk subshift is aperiodic and uniquely ergodic.

## 2 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.

### 2.1 Subshifts

*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

*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

*left-shift*. A closed set \(Y \subseteq {\mathscr {A}}^{\mathbb {N}}\) which is left-shift 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

*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*.

*concatenation*of

*w*and

*v*. For \(m \in \mathbb {N}\), we denote by \(v^{m}\) the

*m*-fold concatenation of

*v*with itself, namely

*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 ^{j-1}(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)\) *s*-*right 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 *s*-right special for some \(s \ge 2\).

### 2.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

*Y*is called \(\alpha \)-

*repetitive*if \(R_{\alpha }\) is finite and non-zero.

### 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 1-repetitive are equivalent for aperiodic subshifts.

*Y*is called

*repulsive*if the value

### Definition 2.4

*Y*set

*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 1-finite is equivalent to the property of being power free.

### Definition 2.6

*Y*and for \(n \in \mathbb {N}\) set

*Y*is \(\alpha \)-

*finite*if the value

*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

*Y*, we define the

*complexity function*\(p :\mathbb {N} \rightarrow \mathbb {N}\) of

*Y*by

## 3 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

- (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)\).

*k*sufficiently large. Since \(W_{(k)}^{p_{k}-1}\) is a prefix and a suffix of \(W_{(k)}^{p_{k}}\) we have that

*k*sufficiently large. Therefore, we have that \(\ell _\alpha =0\).

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 *l*-Grigorchuk 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.

## 4 *l*-Grigorchuk subshifts

### 4.1 \({\varvec{l}}\)-Grigorchuk subshifts

The Grigorchuk subshift is a subshift associated to Grigorchuk’s infinite 2-group *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.

*Grigorchuk subshift*. Alternatively, this subshift can be generated by the three semi-group homomorphisms \(\tau _{x}\), \(\tau _{y}\) and \(\tau _{z}\) defined by

*l*-Grigorchuk subshifts, where each \(l = (l_{k})_{k \in \mathbb {N}}\) is a sequence of natural numbers.

*N*(

*j*) and

*q*(

*j*) the unique integers such that

### 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 \)

*l*-

*Grigorchuk 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

*l*-Grigorchuk 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 formwhere 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

*l*-Grigorchuk 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

### Corollary 4.3

An *l*-Grigorchuk subshift is repulsive if and only if it is 1-repulsive.

### Proof

For an *l*-Grigorchuk 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 *l*-Grigorchuk subshift is repulsive if and only if it is 1-repulsive. \(\square \)

### Proposition 4.4

An *l*-Grigorchuk 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 \)

*G*. Indeed, \(\kappa \) is (a version of) the substitution used by Lysenok [33] to obtain a presentation of

*G*. More specifically, [33] shows that

*l*equal to the constant 1 sequence, that is \(l = (l_{i})\) with \(l_{i} = 1\).

### 4.2 \(\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 *l*-Grigorchuk subshift is \(\alpha \)-finite, which by Theorem 3.1 is equivalent to the subshift being \(\alpha \)-repulsive. In particular, we obtain that an *l*-Grigorchuk subshift is 1-finite (and hence 1-repulsive) if and only if *l* is a bounded sequence. Thus, as 1-repulsive implies repulsive, if *l* is a bounded sequence, then the associated *l*-Grigorchuk subshift is repulsive.

### Theorem 4.5

- (i)
An

*l*-Grigorchuk subshift is \(\alpha \)-repulsive. - (ii)
An

*l*-Grigorchuk subshift is \(\alpha \)-finite. - (iii)
\(\limsup _{n \rightarrow \infty } |l_{n+1} + (1 - \alpha ) \sum _{i = 1}^{n} l_{i} |<\infty \).

### Theorem 4.6

*l*-Grigorchuk subshift fulfils the following equality.

For the proof of this result we will require the following definition and remark.

### Definition 4.7

### 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 semi-group homomorphism which maps *a* to *a* and applies a cyclic permutation to \(\{ x, y, z \}\).

### Proof of Theorem 4.6

- (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 )\), thenwhere$$\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)
*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_{k-1})\) and, moreover, \(Q(v) - 1 \le Q(\eta |_{2^n+r}) \le Q(v)\).

*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,

*a*, it follows that if \(n \equiv 1 \pmod {2}\), then \(Q(n) = 1\).

*j*is the smallest integer such that \(k/2^{j} \equiv 2 \pmod {4}\).

### Corollary 4.9

An *l*-Grigorchuk subshift satisfies \(Q(2^{j + 1}) = 2^{l_{N(j)} - q(j) + 1} - 1\), for all \(j \in \mathbb {N}\).

### 4.3 \(\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 *l*-Grigorchuk subshift is \(\alpha \)-repetitive. In particular, we obtain that an *l*-Grigorchuk subshift is 1-repetitive if and only if *l* is a bounded sequence. Thus, as 1-repetitive implies linearly repetitive, if *l* is a bounded sequence, then the associated *l*-Grigorchuk subshift is linearly repetitive. We would also like to mention here that an exact formula for the repetitive function of an *l*-Grigorchuk subshift has been obtained, independently, in [32], and hence they have also obtained a criterion similar to ours for an *l*-Grigorchuk subshift to be \(\alpha \)-repetitive.

### Theorem 4.10

*l*-Grigorchuk 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

*l*-Grigorchuk subshift satisfies the following inequalities, for \(j \in \mathbb {N}\),

### Proof

*a*and both \(\tau ^{(j-1)}(a)\) and \(\tau ^{(j)}(a)\) are palindromes, there exists an integer \(m \in [2^{j-1}+1, 2^{j}-1]\) with

### Proof of Theorem 4.10

### 4.4 Examples

Here we discuss several examples of sequences \(l = (l_{n})_{n \in \mathbb {N}}\) for which the associated *l*-Grigorchuk subshift exhibits difference order characteristics.

### Example 4.12

- (i)
If

*l*is a bounded sequence, then the associated*l*-Grigorchuk subshift is 1-repetitive and 1-repulsive, and hence, 1-finite. - (ii)
Let \(b \ge 2\) denote a fixed integer. If \(l = ( b^{n} )_{n \in \mathbb {N}}\), then the associated

*l*-Grigorchuk subshift is \(b^{2}\)-repetitive, and*b*-repulsive (and hence*b*-finite). 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*l*-Grigorchuk subshift is 2-repetitive, 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*l*-Grigorchuk 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 non-constant polynomial

*P*with \( l_{n}=P(n)\), then the*l*-Grigorchuk 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 *l*-Grigorchuk 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 *l*-Grigorchuk 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 *l*-Grigorchuk subshift is \(\alpha \)-repulsive, and hence \(\alpha \)-finite, then it is \(\alpha ^2\)-repetitive.

### Proof

*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\) thatfor 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 \)

### 4.5 Aperiodicity, complexity and ergodicity

We now turn to computing the value of the complexity function for a given *l*-Grigorchuk subshift. Knowing the behaviour of the complexity function allows us to conclude that any *l*-Grigorchuk 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

*l*-Grigorchuk subshift satisfies,

For the proof of this result we will use the following lemma.

### Lemma 4.15

The factor \(\tau ^{(j)}(a)\) is 3-special for every \(j\in \mathbb {N}_0\).

### Proof

This follows from the structure of \(\eta \) given in (5). \(\square \)

### Proof of Theorem 4.14

### Corollary 4.16

Every *l*-Grigorchuk subshift is aperiodic.

### Proof

By Proposition 4.4 we know that every *l*-Grigorchuk subshift is minimal. Therefore, if an *l*-Grigorchuk subshift was not aperiodic, then its complexity function would be bounded, contradicting Theorem 4.14. \(\square \)

### Corollary 4.17

Every *l*-Grigorchuk subshift is uniquely ergodic.

### Proof

*l*-Grigorchuk subshift \(\Omega (\eta )\) we define the associated two-sided 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 bi-infinite 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

Alternatively, one can show that any *l*-Grigorchuk 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_{i-1}\) and \(l_{i+1}\) are non-zero, and the homomorphisms \(\tau _x\), \(\tau _y\) and \(\tau _z\) all occur infinitely often in the construction of \(\eta \).

## Notes

### 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 Friedrich-Schiller-Universitä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.

## References

- 1.Arnoux, P., Rauzy, G.: Représentation géométrique de suites de complexité \(2n+1\). Bull. Soc. Math. France
**119**(2), 199–215 (1991)MathSciNetCrossRefGoogle Scholar - 2.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)Google Scholar
- 3.Baake, M., Moody, R.V. (eds).: Directions in mathematical quasicrystals. CRM Monogr. Ser.
**13**. American Mathematical Society, Providence, RI (2000)Google Scholar - 4.Berthé, V.: S-Adic Expansions Related to Continued Fractions. RIMS Kyokuroku Bessatsu
**B58**, 61–84 (2016)Google Scholar - 5.Berthé, V., Delecroix, V.: Beyond Substitutive Dynamical Systems: S-Adic Expansions, vol. B46 , pp. 81–123. RIMS Lecture note ‘Kokyuroku Bessatu’ (2014)Google Scholar
- 6.Berthe, V., Rigo, M.: Combinatorics, Automata and Number Theory, 1st edn. Cambridge University Press, New York (2010)CrossRefGoogle Scholar
- 7.Bon, M.N.: Topological full groups of minimal subshifts with subgroups of intermediate growth. J. Mod. Dyn.
**9**, 67–80 (2015)MathSciNetCrossRefGoogle Scholar - 8.Boshernitzan, M.: A unique ergodicity of minimal symbolic flows with linear block growth. Anal. Math.
**44**, 77–96 (1984/85)MathSciNetCrossRefGoogle Scholar - 9.Conway, J.H., Guy, R.: The Book of Numbers. Copernicus, Germany (1995)Google Scholar
- 10.Damanik, D., Lenz, D.: Substitution dynamical systems: characterization of linear repetitivity and applications. J. Math. Anal. Appl.
**321**, 766–780 (2006)MathSciNetCrossRefGoogle Scholar - 11.Damanik, D., Lenz, D.: The index of sturmian sequences. Eur. J. Comb.
**23**(1), 23–29 (2002)MathSciNetCrossRefGoogle Scholar - 12.Day, M.M.: Amenable semigroups. Ill. J. Math.
**1**, 509–544 (1957)MathSciNetzbMATHGoogle Scholar - 13.Durand, F.: Linearly recurrent subshifts have a finite number of non-periodic subshift factors. Ergod. Theory Dyn. Syst.
**20**, 1061–1078 (2000)MathSciNetCrossRefGoogle Scholar - 14.Durand, F., Host, F., Skau, C.: Substitution dynamical systems, Bratteli diagrams and dimension groups. Ergod. Theory Dyn. Syst.
**19**, 953–993 (1999)CrossRefGoogle Scholar - 15.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)Google Scholar
- 16.Fuhrmann, G., Gröger, M., Jäger, T.: Amorphic complexity. Nonlinearity
**29**(2), 528 (2016)MathSciNetCrossRefGoogle Scholar - 17.Grigorchuk, R.I.: On Burnside’s problem on periodic groups. Funktsional. Anal. i Prilozhen.
**14**, 53–54 (1980)MathSciNetCrossRefGoogle Scholar - 18.Grigorchuk, R.: On the Milnor problem of group growth. Soviet Math. Dokl.
**1**(28), 23–26 (1983)zbMATHGoogle Scholar - 19.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)MathSciNetGoogle Scholar - 20.Grigorchuk, R., Lenz, D., Nagnibeda, T.: Schreier Graphs of Grigorchuk’s Group and a Substitution Associated to a Non-primitive Subshift. arXiv:1510.00545 (2016) (
**Preprint**) - 21.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**) - 22.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**) - 23.Kůrka, P.: Topological and Symbolic Dynamics. Société Mathématique de France, Marseille, France (2003)Google Scholar
- 24.Haynes, A., Koivusalo, H., Walton, J.: A Characterization of Linearly Repetitive Cut and Project Sets. arXiv:1503.04091 (2015) (
**Preprint**) - 25.Hedlund, G.A., Morse, M.: Symbolic dynamics II: Sturmian trajectories. Am. J. Math.
**62**, 1–42 (1940)MathSciNetCrossRefGoogle Scholar - 26.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)CrossRefGoogle Scholar - 27.Kellendonk, J., Lenz, D., Savinien, J.: A characterization of subshifts with bounded powers. Discrete Math.
**313**(24), 2881–2894 (2013)MathSciNetCrossRefGoogle Scholar - 28.Kellendonk, J., Savinien, J.: Spectral triples and characterization of aperiodic order. Proc. Lond. Math. Soc.
**104**, 123–157 (2012)MathSciNetCrossRefGoogle Scholar - 29.Lagarias, J.C.: Geometric models for quasicrystals I. Delone sets of finite type. Discrete Comput. Geom.
**21**(29), 161–191 (1999)MathSciNetCrossRefGoogle Scholar - 30.Lagarias, J.C., Pleasants, P.A.B.: Local complexity of Delone sets and crystallinity. Can. Math. Bull.
**45**(4), 634–652 (2002)MathSciNetCrossRefGoogle Scholar - 31.Lagarias, J.C., Pleasants, P.A.B.: Repetitive Delone sets and quasicrystals. Ergod. Theory Dyn. Syst.
**23**(3), 831–867 (2003)MathSciNetCrossRefGoogle Scholar - 32.Lenz, D., Sell, D.: Private communication. Analysis & Geometry and Dynamical Systems & Mathematical Physics Seminar, 7 July 2016 (2016). http://www.ana-geo-seminars.uni-jena.de/Past+terms/Sommer+term+2016.html. Accessed 25 Mar 2017
- 33.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)Google Scholar - 34.Milnor, J.: Problem 5603. Am. Math. Mon.
**75**, 685–686 (1968)Google Scholar - 35.Moody, R.V. (ed).: The mathematics of long-range 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)Google Scholar - 36.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)Google Scholar - 37.Savinien, J.: A metric characterisation of repulsive tilings. Discrete Comput. Geom.
**54**(3), 705–716 (2015)MathSciNetCrossRefGoogle Scholar - 38.Shechtman, D., Blech, I., Gratias, D., Cahn, J.W.: Metallic phase with long-range orientational order and no translational symmetry. Phys. Rev. Lett.
**53**(20), 1951–1953 (1984)CrossRefGoogle Scholar - 39.Solomyak, B.: Nonperiodicity implies unique composition for self-similar translationally finite tilings. Discrete Comput. Geom.
**20**, 265–279 (1998)MathSciNetCrossRefGoogle Scholar - 40.Walters, P.: An Introduction to Ergodic Theory. Graduate Texts in Mathematics. Springer, Berlin (2013)zbMATHGoogle Scholar

## Copyright information

**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.