Regularity of aperiodic minimal subshifts

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 \geq 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.


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,17,28,29,36,26,37,38]. 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 [27,39]; 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,17,25,29,30,31,32,26] and references therein. In particular, through the work of Durand [13], and Lagarias and Pleasants [32] 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 α-repetitive, α-repulsive and α-finite (α ≥ 1), were recently introduced in [23]. Indeed, we have that 1-repetitive is equialent to aperiodic and linearly repetitive, that 1-repulsive implies repulsive, and that 1-finite is equivalent to power free. For α ≥ 1, a subshift Y which is α-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 ⊂ Y generated by a finite word u is of the order |u| α ; α-repulsive loosely means that if W is a factor of an infinite word in Y and if w 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/α ; and α-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| α−1 .
In [23,29], for Sturmian subshifts with slope θ and for α ≥ 1, it was shown that the characteristics α-repetitive, α-repulsive and α-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 θ were obtained.
Here, we address the following question. For an arbitrary subshift and for α ≥ 1, which of the order conditions α-repetitive, α-repulsive and α-finite are equivalent?
We prove that, for α ≥ 1, a subshift is α-repulsive if and only if it is α-finite (Theorem 3.1). However, for α > 1, we establish that α-repetitive is not necessarily equivalent to α-repulsive, and hence, nor α-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 [18,19] (see also [20], where a general class of groups, denoted by G ω , of intermediate growth is introduced). They have been studied, for instance, by Bon [7], Grigorchuk, Lenz and Nagnibeda [21,22], and Lenz and Sell [33]. These subshifts are determined by an infinite sequence l = (l i ) i∈N of natural numbers and we refer to them as l-Grigorchuk subshifts.
We show that 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 α-repetitive and α-repulsive, and hence, α-finite (Theorems 4.5 and 4.10). More precisely, we prove that an l-Grigorchuk subshift is α-repulsive (and hence α-finite) if and only if lim sup and that an l-Grigorchuk subshift is α-repetitive if and only if lim sup We also obtain an explicit formula in terms of the sequence 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 emphasis that, independently, Lenz and Sell [33] 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 [21,22].
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 [21,22] 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 (Section 4.1), we implicitly associate to a given l-Grigorchuk subshift a group, investigating properties of such groups and if the results of [21,22] 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 α-repetitive, α-repulsive and α-finite. In Section 3 we state and prove the equivalence of α-repulsive and α-finite for arbitrary subshifts over a finite alphabet. We conclude with Section 4, which is divided into five parts. The first part (Section 4.1) is concerned with introducing and defining l-Grigorchuk subshifts as well as stating some of their basic properties. In Sections 4.2 and 4.3 we provide necessary and sufficient conditions on a sequence l which ensures that the associated l-Grigorchuk subshift is α-repulsive (and hence α-finite), and α-repetitive respectively; after which, in Section 4.4, we present several examples of sequences l = (l n ) n∈N for which the associated l-Grigorchuk subshift is α-repetitive, and α-repulsive (and hence α-finite) for specific values of α. Here, we also show that if an l-Grigorchuk subshift is α-repulsive and hence α-finite, then it is α 2 -repetitive. In our concluding part, Section 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.
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.

Preliminary Definitions
Here, we review the key definitions of subshifts and define three notions of aperiodic order (α-repetitive, α-repulsive and α-finite, for a given α ≥ 1) first introduced for Sturmian subshifts in [23], and which generalise and extend the order conditions often referred to as linearly repetitive, repulsive and power free.
2.1. Subshifts. Let A denote a set of m ∈ N symbols called the alphabet. For n ∈ N we define A n to be the set of all finite words in the alphabet A of length n, and set where by convention A 0 is the set containing only the empty word ε. We denote by A N the set of all infinite words over the alphabet A and equip it with the discrete product topology. The continuous map σ : is referred to as a subshift and the tuple (Y, σ) forms a dynamical system. For an infinite word x = (x n ) n∈N over a finite alphabet A , we set where the closure is taken with respect to the discrete product topology. We call Ω(x) the subshift generated by x. For a subshift Y, the dynamical system (Y, σ) is called minimal if for all y ∈ Y the set Ω(y) is dense in Y. If Y does not contain a periodic element (that is, an element y, such that there exists k ∈ N with σ k (y) = y), then we call Y aperiodic.
For w = (w 1 , . . . , w k ) and v = (v 1 , . . . , v n ) ∈ A * , we set wv ≔ (w 1 , . . . , w k , v 1 , . . . , v n ), that is the concatenation of w and v.  Note that A * together with the operation of concatenation defines a monoid with identity element ε. The length of v is denoted by |v| with |ε| = 0 and, for k ≤ n a natural number, we set v| k ≔ (v 1 , v 2 , . . . , v k ). We say that a word u ∈ A * is a factor of v if there exists an integer j with u = σ j−1 (v)| |u| . We use the same notations when v is an infinite word. The integer j is refereed to as an occurrence of u in v.
An infinite word x over a finite alphabet 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 L(Y) of a subshift Y is the set of all factors of the elements of Y. Similarly, we define the language L(x) of an infinite word x to be the set of all factors of x. Notice, the language of Ω(x) of an infinite word x is equal to the language of x, namely L(Ω(ν)) = L(ν). Following convention, the empty word ε is assumed to be contained in every language. For s ≥ 2, we call w = (w 1 , . . . , w k ) ∈ L(Y) s-right special if the cardinality of the set {a ∈ A : (w 1 , . . . , w k , a) ∈ L(Y)} is equal to s. A word is called right special if it is s-right special for some s ≥ 2.

2.2.
Notions of aperiodic order. We begin by stating the definition of α-repetitive, first defined in [23] for Sturmian subshifts, which generalises the concept of linearly repetitive.
Definition 2.1. The repetitive function R : N → N of a subshift Y assigns to r the smallest r ′ such that any element of L(Y) with length r ′ contains (as factors) all elements of L(Y) with length r.
Definition 2.2. Let α ≥ 1 be given and set 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) ≤ Kn, for all n ∈ N. Since aperiodicity of a subshift guarantees that the number of words of length n is strictly greater than n, for all n ∈ N, see for instance [15], this yields that linearly repetitive and 1-repetitive are equivalent for aperiodic subshifts.
Next, for α ≥ 1, we state the definition of α-repulsive, which generalises the notion of repulsive. We recall that a subshift Y is called repulsive if the value ℓ ≔ inf |W| − |w| |w| : w, W ∈ L(Y), w is a prefix and suffix of W, and W w ε is non-zero.
where for a given natural number n ≥ 2 A α,n ≔ inf |W| − |w| |w| 1/α : w, W ∈ L(Y), w is a prefix and suffix of W, |W| = n and W w ε , and if ℓ α is finite and non-zero, then we say that Y is α-repulsive.
The next definition is a generalisation of the notion of a subshift being power free. If α = 1, then 1-finite is equivalent to the property of being power free. Definition 2.6. For a subshift Y and for n ∈ N set Q(n) ≔ sup{p ∈ N : there exists W ∈ L(Y) with |W| = n and W p ∈ L(Y)}.
Let α ≥ 1 be given. We say that the subshift Y is α-finite if the value Q α ≔ lim sup n→∞ Q(n) n α−1 is non-zero and finite. Also, for ease of notation, for a given word v ∈ L(Y), we let Q(v) denote the largest integer p such that v p ∈ L(Y), in the case that no such p exists, we set To conclude this section, we state the definition of the complexity function.

General Results
Theorem 3.1. For α ≥ 1 and x an infinite word over a finite alphabet, we have that Ω(x) is α-repulsive if and only if it is α-finite.
Proof. Let α ≥ 1 be fixed and let Ω(x) be α-repulsive. Suppose that Q α = ∞. In this case there exist sequences of natural numbers (n k ) k∈N and (p k ) k∈N satisfying Thus, we have that p k > 1, for all k sufficiently large. Since W for all k sufficiently large. Therefore, we have that ℓ α = 0.
Since 0 < ℓ α < ∞, this means that there exists a sequence (n k ) k∈N of natural numbers such where the lengths of the u (k) are unbounded, as otherwise lim sup k→∞ Q(u (k) ) = ∞. However, since by assumption Q α = 0, we have This together with (1) yields that ℓ α = ∞.
Proposition 3.2. Let α ≥ 1 be given and let x denote an infinite word over a finite alphabet.
Proof. We show the contrapositive. Suppose that there exists a y ∈ Ω(x) such that σ k (y) = y, for some k ∈ N. This implies that Q(nk) = ∞, for all n ∈ N, and so, for all α ≥ 1 we have that Q α = ∞. Therefore, the subshift Ω(x) is not α-finite for any α ≥ 1.
For an aperiodic subshift Y we have that R(n) > nQ(n), for all n ∈ 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 ∈ N, see for instance [15].
Let n ∈ N be fixed. Let w ∈ L(Y) be such that |w| = n and w Q(n) ∈ L(Y). The word w Q(n) has at most n different factors of length n. Thus, since |w Q(n) | = nQ(n) and since L(Y) is aperiodic, we have that R(n) > nQ(n).
An infinite word x in which one of the letters only occurs exactly once gives rise to a subshift Ω(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 α-finite (or equivalently α-repulsive), but not α-repetitive, see Example 4.12.
4. l-Grigorchuk subshifts 4.1. l-Grigorchuk subshifts. The Grigorchuk subshift is a subshift associated to Grigorchuk's infinite 2-group G. The group G was originally introduced in [18,19] and is an infinite finitely generated torsion group and so belongs to the class of Burnside groups, see also [20]. It has growth between polynomial and exponential, hence is amenable but not elementary amenable, see [20]. This group therefore provided simultaneous answers to the question of Milnor [35] on existence of groups of intermediate growth, and to the question of Day [12] on existence of amenable but not elementary amenable groups. Lysenok [34], gave a recursive presentation of G by generators and relations using a homomorphism κ, which we will shortly define, see (2) and (6). It is remarkable that the homomorphism κ serves not only to define G algebraically, but also, as is shown in [21], 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 semi-group homomorphism κ : {a, x, y, z} * → {a, x, y, z} * by and for a finite word w = (w 1 , . . . , w n ) we set κ(w) ≔ κ(w 1 ) . . ., κ(w n ). The homomorphism κ is defined to act on infinite words analogously. It is known that there exists a unique infinite word η ∈ {a, x, y, z} N such that κ(η) = η, see for instance [21]. We call the subshift Ω(η) the Grigorchuk subshift. Alternatively, this subshift can be generated by the three semi-group homomorphisms τ x , τ y and τ z defined by where β ∈ {x, y, z}, and for w = (w 1 , . . . , w n ) we set τ β (w) ≔ τ β (w 1 ), . . . , τ β (w n ). Indeed, the word η is the unique word with the prefix for all n ∈ N. We now introduce a more general class of subshifts based on this latter construction, which we call l-Grigorchuk subshifts, where each l = (l k ) k∈N is a sequence of natural numbers.
Let l = (l k ) k∈N denote a fixed sequence of natural numbers. For j ∈ N, we denote by N( j) and q( j) the unique integers such that We define τ ( j) by and let τ (0) be the identity. Additionally, we set Proof. This is a consequence of the fact that, τ ( j) (a) is a prefix of τ ( j+1) (a), for all j ∈ N 0 , and, as we will see in Proposition 4.2, lim j→∞ |τ ( j) (a)| = ∞.
For a given sequence of natural numbers l = (l k ) k∈N , we refer to the subshift Ω(η l ) as the l-Grigorchuk subshift, where η l is the unique word given in Proposition 4.1. When it is clear from the context, we will write η instead of η l . Note that the Grigorchuk subshift is an l-Grigorchuk subshift with l equal to the constant one sequence, namely l = (1, 1, 1, . . .). By construction, for all j ∈ N, we observe that η 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 l-Grigorchuk subshift where elements of l are allowed to take the value zero, see Remark 4.18.
Proof. We have that |τ (0) (a)| = |a| = 1. Suppose the result holds true for some j ∈ N 0 , then This completes the proof. Proof. For an l-Grigorchuk subshift, we observe that since τ ( j) (a) is a prefix and suffix of τ ( j+1) (a) and since τ ( j) (a) ∈ L(η), for j ∈ N, by Proposition 4.2 we have Q 1 ≤ 1. Therefore, an l-Grigorchuk subshift is repulsive if and only if it is 1-repulsive. Proof. For every word w in the language of η there exists a j ∈ N such that w is a factor of τ ( j) (a). The structure of η, namely that given in (5), yields that the gap between two successive occurrences of w's is bounded, and so, η is uniformly recurrent. As uniformly recurrence is equivalent to minimality, see for instance [6], this completes the proof.
While we do not use it in the sequel we would like to highlight the role κ and τ ( j) , and hence τ x , τ y and τ z , play in Grigorchuk's infinite 2-group G. Indeed, κ is (a version of) the substitution used by Lysenok [34] to obtain a presentation of G. More specifically, [34] shows that This presentation can be written using τ ( j) , and hence τ x , τ y and τ z , by using the fact that κ j (a, z) = τ ( j) (a, β ( j−1) ), and that, for all j ∈ N, Here τ ( j) and β ( 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.

4.2.
α-Finite and α-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 α-finite, which by Theorem 3.1 is equivalent to the subshift being α-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. For α ≥ 1 the following three statements are equivalent.
Proof. The result follows from Theorem 3.1 and Theorem 4.6 given below.
For the proof of this result we will require the following definition and remark.  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.
Assume that the conditions of Statement (iii) hold, that is k = 2 n + r ≡ 2 (mod 4), where n ∈ N and 0 ≤ r < 2 n . By construction we have that η i = x for all i ≡ 2 (mod 4). Thus, (a, x, a) (a, x, a) (a, x, a) (a, x, a) (a, x) ? ?
(Note here that Q(η| k ) is taken with respect to the language L(η) and Q(η ( j) | k/2 j ) is taken with respect to the language L(η ( j) )). This in tandem with Remark 4.8 and Statement (iii) yields that where j is the smallest integer such that k/2 j ≡ 2 (mod 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 ∈ L(η) with Q(v) ≥ 3 and with |v| = 2 n + r, for some n ∈ N, and 0 ≤ r < 2 n . Due to the structure of η given in (5), where we set j = n − 1, and since every (2m + 1)-th question mark in (5) is equal to β ( j) , for all m ∈ N 0 , we have that τ ( j) ((a, β ( j) )) is a factor of v Q(v) . Thus there exists a natural number k ≤ 2 n + r such that With Statements (i), (ii), (iii),(iv) and (v) at hand we can now prove the required result. If k ≡ 0 (mod 4), then the left hand side of (7) is maximised on the set [2 n , 2 n+1 ) ∩ N, at j = n − 1, namely when k = 2 n . Further, (7) in tandem with (5) and Proposition 4.2, yields where 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). 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.
4.3. α-Repetitive. Our next result gives a necessary and sufficient condition on a given sequence of natural numbers l = (l i ) ∞ i=1 to guarantee that the associated l-Grigorchuk subshift is α-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 [33], and hence they have also obtained a criterion similar to ours for an l-Grigorchuk subshift to be α-repetitive.
We prove Theorem 4.10 by using the following bounds on the repetitive function.
Similarly, for all k ∈ {1, 2, . . ., 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 η, given a word of length 2 j+1 − 1 in L(η) it is necessarily a factor of τ ( j) • τ x (a), τ ( j) • τ y (a) or τ ( j) • τ 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.
Proof of Theorem 4.10. For n ∈ N, let j = j(n) denote the unique natural number such that 2 j−1 ≤ n < 2 j . By definition, the repetitive function is monotonically increasing, and so R(2 j−1 − 1) ≤ R(n) ≤ R(2 j − 1). Combining this with Lemma 4.11, yields that This completes the proof.

Examples.
Here we discuss several examples of sequences l = (l n ) n∈N for which the associated l-Grigorchuk subshift exhibts difference order characteristics.
(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 ≥ 2 denote a fixed integer. If l = (b n ) n∈N , then the associated l-Grigorchuk subshift is b 2 -repetitive, and b-repulsive (and hence b-finite). Thus, in general, α-repetitive is not equivalent to α-repulsive, and hence nor α-finite. (iii) Let (b n ) n∈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 α-repulsive nor α-finite, for any value of α ≥ 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 α-repetitive, α-repulsive nor α-finite for any value of α ≥ 1. (v) If l = (l n ) n∈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 α-repulsive, α-finite nor α-repetitive, for any value of α ≥ 1. This is a consequence of Faulhalber's formula [9].
From Example 4.12 (ii) and (iii), for α > 1, we see that the l-Grigorchuk subshifts provide examples which demonstrate that α-repulsive, and hence α-finite, is not equivalent to α-repetitive. This gives rise to the question how the notions of α-repetitive and β-repulsive, and hence β-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 α-repulsive, and hence α-finite, then it is α 2 -repetitive.
Proof. Observe that, for all n ∈ N, By the hypothesis and Theorem 4.5, we have that lim sup n→∞ |l n+1 +(1 −α) n i=1 l i | is a finite real number. In the following, we denote this value by c. Given ǫ > 0, there exists an N ∈ N, such that, for all n ≥ N, This in tandem with Equation (13) yields for δ ≥ 1 that for all n ≥ N. This in combination with the hypothesis of the proposition and the Theorems 4.5 and 4.10 yields the required result.

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 [33] 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 [21,22], where the case when l is the constant one sequence is considered.
In the sequel, for ease of notation, for n ∈ N 0 , we set M(n) ≔ |τ ( n i=1 l i ) (a)| = 2 1+ n i=1 l i − 1. For the proof of this result we will use the following lemma. Proof. This follows from the structure of η given in (5).
Proof of Theorem 4.14. For m = 1, every word of length |τ (l 1 ) (a)| + 1 in L(η) is a factor of at least one of the following words belonging to L(η). This yields that p(|τ (l 1 ) (a)| + 1) = 2|τ (l 1 ) (a)| + |τ (0) (a)|. In the same way, for a fixed m ∈ N, every word of length |τ ( m i=1 l i ) (a)| + 1 in L(η) is a factor of at least one of the following words τ ( m i=1 l i ) (a)xτ ( m i=1 l i ) (a), τ ( m i=1 l i ) (a)yτ ( m i=1 l i ) (a) and τ ( m i=1 l i ) (a)zτ ( m i=1 l i ) (a), which are all contained in L(η) by (5). Additionally, we have With this we obtain that, for all m ∈ N, By Lemma 4.15 the factor τ ( m i=1 l i ) (a) is 3-right special, for all m ∈ N, and so is 3-right special as it is a suffix of τ ( m+1 i=1 l i ) (a). Notice that has the same length as τ (1+ m i=1 l i ) (a), but it is not right special because, by (5), the only possible right-extension is However, due to the structure of η given in Proposition 4.1 and (5), the prefix (2 lm −1)−times , whose length is equal to 2|τ ( m i=1 l i ) (a)| − |τ ( m−1 i=1 l i ) (a)|, is 2-right special. Further, it is not a suffix of τ ( m+1 i=1 l i ) (a). Using these right special words and their respective suffixes of length strictly greater than |τ ( m i=1 l i ) (a)| we obtain that (15) The result follows by combining (14) and (15) together with an inductive argument. 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.