This paper deals with (globally) random substitutions on a finite set of prototiles. Using renormalization tools applied to objects from operator algebras, we establish upper and lower bounds on the rate of deviations of ergodic averages for the uniquely ergodic Rd action on the tiling spaces obtained from such tilings. We apply the results to obtain statements about the convergence rates for integrated density of states for random Schrödinger operators obtained from aperiodic tilings in the construction.

Consider the two substitution and expansion rules defined on the half hexagons in Fig. 1, one of which is the classical half hexagon substitution rule and the other one is obtained by modifying the square (second iteration) of it. This paper is concerned about the random application of substitution and expansion rules such as these in order to construct aperiodic tilings of Rd, the study of the statistical properties of such tilings, and an application to the study of random Schrödinger operators on quasicrystals. Figure 2 gives an example of the types of tilings one can get through random application of the substitution rules in Fig. 1.

FIG. 1.

Two substitution and expansion rules on half hexagons.

FIG. 1.

Two substitution and expansion rules on half hexagons.

Close modal
FIG. 2.

A patch obtained from random applications of the half hex substitution and expansion rules in Fig. 1.

FIG. 2.

A patch obtained from random applications of the half hex substitution and expansion rules in Fig. 1.

Close modal

Although first introduced by Godrèche and Luck (1989), interest in random substitution tilings has surged recently [e.g., Frank and Sadun (2014), Gähler and Maloney (2013), Berthé and Delecroix (2014), Rust (2016), Rust and Spindeler (2018), and Schmieding and Treviño (2021)]. Random substitutions come in two flavors: locally random constructions [e.g., Rust and Spindeler (2018)] and globally random constructions [e.g., Gähler and Maloney (2013) and Schmieding and Treviño (2021)]. The typical features of globally random tilings are repetitivity, uniform patch frequencies (equivalent to unique ergodicity, see Sec. II), and zero entropy, whereas locally random tilings typically have positive entropy and non-uniform patch frequencies. This distinction is similar to that between strictly ergodic and mixing subshifts. All of the constructions in this paper are of globally random flavor, and so, although it will not be stated repeatedly that they are of global type, the reader should assume so throughout this paper.

The present work can be seen as an extension or alternative to Schmieding and Treviño (2021). It is an extension because the class of functions for which theorems are proved here (Lipschitz functions) is much larger than the class of functions treated in that work (smooth transversally locally constant functions). It is also an alternative because the present paper develops new tools combining ideas of renormalization with objects from operator algebras. More specifically, an object called the trace cocycle is introduced, developed, and used here to obtain results on deviations of ergodic integrals for Lipschitz functions on tiling spaces coming from random substitutions. This new tool makes it possible to connect some of the invariants from AF algebras (the traces) with invariants (also traces) from certain “smooth” sub-algebras of the so-called algebras of random Schrödinger operators on aperiodic tilings while giving errors of convergence rates for the Shubin–Bellissard formula.

What both of these approaches have in common is the use of spaces of Bratteli diagrams to organize tilings, which can be constructed from applications of substitution rules defined on the same set of prototiles, and the use of subshifts as a “moduli space” of all tilings, which can be obtained from a finite set of substitution rules, whereon the shift dynamics become renormalization dynamics. In Schmieding and Treviño (2021), the topology of the resulting tiling spaces was well-studied and exploited to obtain statistical results for the tilings.

In this paper, the renormalization approach is applied to certain invariants (the traces) from operator algebras to study the properties of the random substitution tilings, although they are close in spirit to the tools used by Bufetov in his study of deviation of ergodic integrals for several classes of systems (Bufetov, 2014; 2013; and Bufetov and Solomyak, 2013). What is gained from this point of view is that there is no need to have a full understanding of the topology of the tiling spaces constructed at random, making computations easier to make, as demonstrated in Sec. IX; what is lost is the access to topological information of the tiling spaces constructed in the construction.

Here, progress is also made with the issue of boundary effects. By “boundary effects,” I mean the following: in most studies of uniquely ergodic Rd-actions on metric spaces, when d > 1, it has been usually hard to obtain information of the error terms of ergodic integrals of functions over sets of volume ∼Td that are smaller than Td−1, which is the contribution of the boundary of the averaging set to the integral (Sadun, 2011; Bufetov and Solomyak, 2013; Schmieding and Treviño, 2018a; and 2021). These issues have been overcome in other settings of higher rank Abelian actions [e.g., Cosentino and Flaminio (2015)], but they have remained an obstacle in the study of tilings. In this paper, I show that given some set B, there is an arbitrarily close set Bɛ and a set of dilations of Bɛ such that the deviation behavior along those averaging sets are fully described by the Lyapunov spectrum of our renormalization cocycle. As the title suggests and it was suggested above, functionals from operator algebras called traces play a prominent role here, being the analog to cycles in Zorich’s theory (Zorich, 1999), currents in Forni’s theory (Forni, 2002), and finitely additive measures in Bufetov’s theory (Bufetov, 2014). [Ian Putnam recently pointed out to me that Bowen and Franks (1977), Theorem 2.1, shows that the space of traces considered here and the space of finitely additive measures that Bufetov considered are isomorphic.] Our cocycle is defined on a bundle of traces analogous to the cohomology bundle used for the Kontsevich–Zorich cocycle.

Given that aperiodic tilings serve as models for quasicrystals, the results on deviations of ergodic averages here have several applications in mathematical physics. The advantage here of using an operator algebra approach is that it makes the connection to the study of random Schrödinger operators more natural. In Schmieding and Treviño (2018b), it was shown that asymptotic properties of traces of random Schrödinger operators defined by certain self-affine aperiodic tilings are controlled by traces obtained through the behavior of ergodic integrals on the tiling space. Here, a generalization is made and the connection is made more explicit: since traces on locally finite subalgebras of AF algebras control the behavior of the ergodic integrals for randomly constructed tilings, one can obtain traces on algebras of operators that control the asymptotic properties of the integrated density of states for the so-called random Schrödinger operators.

Let ΣN be the full N-shift, that is, the space of bi-infinite sequences of symbols from an alphabet of N symbols. Given a set of prototiles {t1, …, tN} and N uniformly expanding and compatible substitution rules F={F1,,FN} on them (see the precise definition of the substitution rule in Sec. II), there is a subshift of finite type XFΣN, which parameterizes all the tiling spaces that can be obtained by random applications of the substitution rules in F: given xXF, there is a corresponding compact metric space (called a tiling space) Ωx whose elements are tilings with the hierarchical structure dictated by the point x according to the substitution rules in F. Periodic points in XF give rise to tiling spaces Ωx consisting of self-similar tilings.

The tiling spaces admit a Rd action, which is denoted by φt : Ωx → Ωx, and for many of them, this action is minimal and uniquely ergodic (this will be the scenario considered in this paper; see Proposition 2). The concept of a minimal measure is used here (see Sec. III A for the precise definition), and this roughly means that μ on XFΣN is minimal if for μ-almost every xXF, Ωx admits a minimal Rd action. The shift map σ:XFXF defines a homeomorphism Φx : Ωx → Ωσ(x) of tiling spaces. As such, the shift drives the renormalization dynamics.

The way of constructing Ωx from x is through a Bratteli diagram Bx: a point xXF establishes how a sequence of substitutions from the family F are put together to obtain a tiling, and this sequence is represented by an infinite directed graph Bx whose structure is tied to that of Ωx. As such, any point xXF defines a *-algebra LF(Bx+), called a locally finite algebra (this is defined in Sec. V), which is dense in an approximately finite dimensional (AF) C∗-algebra AF(Bx+). The dual of LF(Bx+)AF(Bx+) is the trace space of LF(Bx+), which is a finite dimensional vector space over C. Here, a trace τ on a *-algebra A is taken to be any linear map τ:AC satisfying τ(ab) = τ(ba). Note that since every element of K0(AF(Bx+)) can be represented by an element in LF(Bx+), the space of traces Tr(Bx+) can be seen as the dual to K0(AF(Bx+)). The dual to Tr(Bx+) as a vector space is the space of cotraces Tr*(Bx+), and it is this space that has great importance. We define the trace bundle to be the set of pairs (x, τ′) with τTr*(Bx+). The shift σ:XFXF induces a linear map σ*:Tr*(Bx+)Tr*(Bσ(x)+), yielding a linear cocycle over the shift σ, which we call the trace cocycle. The Lyapunov spectrum of this cocycle, that is, the growth rate of cotrace vectors under the trace cocycle, is what controls the statistical properties of the tilings.

Let L(Ωx) denote the set of Lipschitz functions on Ωx. For any Oseledets-regular x, that is, for any x for which the conclusion of the Oseledets theorem holds (see Sec. V A), there is a map ix+:L(Ωx)LF(Bx+) (see Sec. VI) and we denote by [af]=ix+(f) the image of fL(Ωx) through this map. Before stating the first theorem, some notation is needed. For a set BRd, we denote by T · B the scaling (T · Id)B. A good Lipschitz domain is defined in Sec. II A, but for now, it suffices to say that it is a set whose boundary is not too complicated.

Theorem 1.

LetFbe a finite family of uniformly expanding and compatible substitution rules on a finite set of prototiles {t1, …, tM} withXFΣNparameterizing the possible tiling spaces andμbeing a minimal,σ-invariant ergodic Borel proability measure.

There exist Lyapunov exponentsλ1+>λ2+λdμ++>0(depending onFandμ) such that forμ-almost everyx, there are tracesτ1+,,τdμ++Tr(Bx+)such that iffL(Ωx)satisfiesτi+([af])=0for alli < jfor somejdμ+butτj+([af])0,Ba good Lipschitz domain, andTΩx, then for everyɛ > 0 there exists a setBɛ, which isɛ-close toBin the Hausdorff metric, a sequenceTk → ∞, and a convergent sequence of vectorsτksuch that
lim supklogTk(Bε+τk)fφt(T)dtlogTk=dλj+λ1+.
(1)
If, in addition,dλj+(d1)λ1+, then
lim supTlogTBfφt(T)dtlogTdλj+λ1+.
(2)

Remark 1.

Some remarks are as follows:

  • The case of self-similar tilings, tilings that are constructed from a single substitution rule, corresponds to tiling spaces Ωx for periodic points x under the shift σ : ΣN → ΣN. In other words, tiling spaces for self-similar tilings correspond to the typical points of finitely supported invariant measures on ΣN (assuming they are minimal measures). Studies of deviations of ergodic integrals for such types of systems have been done elsewhere (Sadun, 2011; Bufetov and Solomyak, 2013; and Schmieding and Treviño, 2018a). Therefore, what is new here are the results for tiling spaces that do not come from self-similar tilings, that is, tilings that come from tiling spaces Ωx for x a typical point of a σ-invariant, ergodic measure satisfying the hypotheses of the theorem which is not finitely supported. There is a continuum of examples in Sec. IX.

  • The spectral gap λ1+>λ2+ is a consequence of the recent general spectral gap result of Horan (Horan, 2019, Corollary 2.19).

There is a particular type of tiling space, called a solenoid, which satisfies a type of bound known as the Denjoy–Koksma inequality (the trace space is trivial for solenoids, so Theorem 1 does not yield any information). The solenoid construction here is dependent on a family of substitution rules given by a sequence of positive integers q̄=(q1,q2,), each one greater than 1. There is also a concept of function of bounded variation on the solenoid Ωq̄, and the space of all functions of bounded variation on Ωq̄ is denoted by BV(Ωq̄) (see Sec. VII). For q̄NN, denote q(n) = q1q2, …, qn, and let μ be the unique invariant measure on Ωq̄.

Theorem 2.
LetΩq̄be ad-dimensional solenoid. Then, for anyfBV(Ωq̄)andpΩq̄,
[0,q(n)]dfφs+(p)dsq(n)dΩq̄fdμVar(f)
for alln > 0.

The Denjoy–Koksma inequality was first proved for irrational circle rotations by Herman (Herman, 1979, Theorem VI.3.1). Theorem 2 here is the first instance of this type of inequality for higher rank systems.

Let T be a repetitive tiling with finitely many prototiles. Consider the Delone set ΛTRd obtained by puncturing every prototile in its interior and forming ΛT as the union of all the corresponding punctures on tiles of T, which correspond to punctures of the prototiles. There is a class of operators on 2(ΛT), called the Lipschitz operators of finite range, denoted by LAxfin. These operators are defined in Sec. VIII, but what is relevant here is that they contain operators of interest in mathematical physics, namely, self-adjoint operators of the form H = Δ + V, where Δ is a Laplacian-type operator and V is any potential reflecting the aperiodic and repetitive nature of all tilings in Ωx. (A simple example to consider in one dimension is as follows. Let T be a tiling of R by N different tile types and ΛT be the collection of endpoints of tiles of T. There is an obvious, order-preserving labeling of Λ by Z. For i ∈ {1, …, N} and λ ≠ 0, consider the operator Hi,λ = Δ + λVi, where Δ is the discrete Laplacian on Z and the localized potential Vi is defined by Vi(p) = p if p ∈ Λ is a left endpoint of a tile of type i and otherwise Vi(p) = 0. Similar constructions can be made for tilings in higher dimensions by considering the graph GT given by the Delaunay triangulation of ΛT, considering the graph Laplacian GT on GT, and considering an operator of the form H=GT+V, where V is a localized potential depending only on the local pattern around pΛT.) These types of operators sometime go under the name of random Schrödinger operators.

For TΩx and ALAxfin a self-adjoint operator, we have the operator AT acting on 2(ΛT) and this assignment is equivariant with respect to the Rd action on Ωx. Denote by AT|B the restriction of AT to the finite dimensional subspace 2(ΛTB)2(ΛT) defined by ΛTB. For ER and T > 0, denote

nTA(E)#{eigenvalues of AT|BT, which are E}.

Assuming T is repetitive and has finite local complexity and uniform patch frequency, that is, T corresponds to a minimal and uniquely ergodic system, the function

ElimTnTA(E)Vol(BT)

is the distribution of a measure ρA (independent of T in the tiling space), called the integrated density of states (Lenz and Stollmann, 2005), satisfying

ρA(φ)=τ(φ(A))limTtr(φ(A|BT))Vol(BT),
(3)

where tr(φ(A|BT)) is the unique (non-normalized) trace of the finite dimensional operator φ(A|BT), and for any continuous φ. This is the Shubin–Bellissard trace formula. It should be emphasized that the fact that the limit in (3) is a trace is not trivial; see Lenz and Stollmann (2003), Lemma 3.4. For a thorough introduction to the study of spectral properties of Schrödinger operators emerging from quasicrystals, see Damanik et al. (2015), Sec. 3.

The question addressed in Schmieding and Treviño (2018b) is as follows: What can be said about the convergence in (3)? In other words, is there a λ ∈ (0, d) such that

tr(φ(A|BT))Vol(BT)τ(φ(A))CTλ

for some C > 0 and all T > 1? The main result of Schmieding and Treviño (2018b) showed that if the tiling or Delone set had a self-affine structure, then yes, error rates for the Shubin–Bellissard trace formula can be computed, and that they can be computed with the help of other traces.

The second main result of this paper is a generalization of the main result of Schmieding and Treviño (2018b) and answering this question in the case of random substitution tilings. Not only are the error rates for the convergence in (3) computed but also the traces responsible for them are related to the traces defined on the LF algebras LF(Bx+) and the error rates are defined by the Lyapunov spectrum of the trace cocycle from Theorem 1. More precisely, in Sec. VIII, for almost every xXF, we define a map ϒx:LAxfinLF(Bx+) and define functionals τiϒx*τi+ by pulling back some of the traces in Tr(Bx+). Whether or not τi′ is a trace on Tr(LAxfin) is dependent on the Lyapunov exponent λi+ (see Proposition 5). The following is a consequence of Theorem 1.

Theorem 3.

LetFbe a finite family of uniformly expanding and compatible substitution rules on a finite set of prototiles {t1, …, tM} withXFΣNparameterizing the possible tiling spaces andμbeing a minimal, ergodic,σ-invariant Borel ergodic proability measure.

There exist Lyapunov exponentsλ1+>λ2+λdμ++>0(depending onFandμ) such that forμ-almost everyx, there are tracesτ1,,τdμ+Tr(Bx+)such that ifALAxfinsatisfiesτix(A)) = 0 for alli < jfor somejdμ+butτjx(A)) ≠ 0, forBa good Lipschitz domain, for everyɛ > 0, there exists a setBɛ, which isɛ-close toBin the Hausdorff metric, a sequenceTk → ∞, and a convergent sequence of vectorsτksuch that
lim supklog|tr(AT|Tk(Bε+τk))|logTk=dλr+λ1+.
If, in addition,dλj+>(d1)λ1+, thenτj=ϒx*τjis a trace and
lim supTlog|tr(AT|TB)|logTdλj+λ1+.

Remark 2.

Some remarks are as follows:

  • These estimates give rates of convergence for the integrated density of states in (3) for random Schrödinger operators as explained in the paragraphs following (3). For example, if under the hypotheses of the theorem, the top two Lyapunov exponents satisfy λ2+>(d1)λ1+/d, then for any ɛ > 0,
    tr(A|BT)Vol(BT)τ(A)CεTdλ2+λ1++ε
    for some Cɛ > 0 and all T > 1.
  • Just like many of the traces on LF(Bx+), a dense subalgebra of the C∗-algebra AF(Bx+), do not extend to the full C∗-algebra, the auxiliary traces that describe the error rates in the convergence of the integrated density of states do not extend to traces on any C∗-algebra. Thus, what is important here is not the C∗-algebra of Schrödinger operators but a dense *-subalgebra consisting of “smooth” operators, which in this case is LAxfin.

  • This statement has no immediate relation to any statement about gap labeling (see Kellendonk (1995) for background).

  • It is unclear to me what physical interpretations the traces τi′ in Theorem 3 have.

This paper is organized as follows: in Secs. II and III, we review the essential definitions related to tilings and Bratteli diagrams and how one can construct tiling spaces using Bratteli diagrams. These sections cover background material, borrowing some results from Schmieding and Treviño (2021). Section IV is an interlude that illustrates the constructions using the example of half-hexagons in Fig. 1. Section V covers locally finite subalgebras of AF algebras and their traces. It is in this section that the trace cocycle is introduced and some basic properties are derived. Section VI is devoted to the study of ergodic integrals for Lipschitz functions on tiling spaces using the trace cocycle. Section VII proves the Denjoy–Koksma inequality for general solenoids. Finally, Sec. VIII covers the application of the main theorem on deviations of ergodic averages to traces on random Schrödinger operators. Section IX shows some experimental results for the easiest non-trivial results I could come up with using half hexagons. It strongly suggests that in this case, the Lyapunov spectrum is non-singular but does have multiplicities.

This section introduces the basic concepts in the theory of tilings. For a more thorough overview, see, e.g., Baake and Grimm (2013) and Sadun (2008).

A tilet is a compact, connected subset of Rd. Here, it will always be assumed that the boundary ∂t of a tile has finite d − 1 dimensional measure. A tilingT of Rd is a cover of Rd by tiles, where two different tiles may only intersect along their boundaries. Here, we will consider only cases where the tilings are formed by a finite set of prototiles {t1, …, tM}. That is, every tile tT is a translated copy of ti for some i. A patch of T is a finite connected union of tiles of T. A tiling T is called repetitive if for any patch P, there exists an RP>0 such that any ball of radius RP contains a translated copy of P in it. For any set ARd, denote

OT(A)= largest patch P of T completely contained in A.

A tiling has finite local complexity if for each R > 0, there exists a finite collection of patches P1,,PN(R) such that for any xRd, the patch OT(BR(x)) is a translated copy of one of the patches Pi.

A substitution ruleF on a finite set of prototiles {t1, …, tM} is a rule that allows us to express each prototile tni in a subset {tn1,,tnF}{t1,,tM} as the finite union of scaled copies of some of the prototiles (note that this differs from the traditional definition of a substitution rule in that traditionally it is all prototiles that are subdivided, whereas here one is allowed to only consider a subset of them and ignore the rest). More precisely, suppose we identify each prototile ti with a subset of Rd, and we assume without loss of generality that this subset contains the origin in its interior. Then, a substitution rule consists of a collection of scaling maps (also called graph iterated function systems) F={fi,j,k:RdRd} with i, j = 1, …, M, k = 1, …, r(i, j) such that

tni=j=1Mk=1r(ni,j)fni,j,k(tj),
(4)

and if for any i, any two maps fi,j,k and fi,j′,k have fi,j,k(tj) ∩ fi,j′,k(tj) ≠ , then the intersection happens along the boundary of the images. In other words, each tni can be tiled by scaled copies of the prototiles ti. The number n(i, j) is the number of copies of a rescaled copy of the prototile tj placed in ti when subdividing. As such, fi,j,1 exists only if there is a rescaled copy of tj found when substituting the prototile ti. The reader who has not seen a substitution rule defined as in (4) is invited to Sec. IV, where the example in Fig. 1 is illustrated from the point of view of (4).

A substitution is uniformly expanding if all maps fi,j,kF are of the form fi,j,k(x) = rx + τi,j,k for some r ∈ (0, 1) and τi,j,kRd. In this case, if r is the contracting factor, r1tni is the union of prototiles, and the rescaling of (4) as

r1tni=j=1Mk=1r(ni,j)r1fni,j,k(tj)
(5)

is a substitution and expansion rule (Fig. 1 gives an example of two such rules, one with contraction 1/2 and the other with contraction 1/4). In defining a substitution rule that is uniformly expanding, one is implicitly defining a substitution and expansion rule by (5).

We will transform tilings by two types of operations: translations and deformations. Let T be a tiling of Rd and τRd. Then, the tiling φτ(T)Tτ is the tiling of Rd obtained by translating each tile of T by the vector τRd. This is the translation of T by τ.

All the tilings that will be considered in this paper will have finite local complexity, so it will be assumed from now on. If tiling T has finite local complexity, then define a metric on the set of all translates of T by

dT,φt(T)=min1,d̄(T,φt(T)),
(6)

where

d̄T,φt(T)=infε>0:OTB1εOφt+s(T)B1ε for some sε,
(7)

where P1P2 denotes the equivalence of patches P1 and P2 by a translation. In words, two tilings are close if they agree on a large ball around the origin up to a small translation. That this is a metric for tilings of finite local complexity is standard; see Baake and Grimm (2013), Sec. 5.4. The tiling space of T is defined as the metric completion of all translates of T with respect to the metric above,

ΩT={φt(T):tRd}̄.

There is a natural action of Rd on ΩT by translation, φt:Tφt(T). The action being minimal is equivalent to T being repetitive. As such, if T is repetitive, then for any two T1,T2ΩT, we have that ΩT1=ΩT2.

Suppose T is a tiling of Rd by a finite collection of prototiles. That is, there is a finite set of tiles {t1, …, tM} such that every tile tT is translation equivalent to ti for some i. For each i, pick a distinguished point in the interior of the prototile ti and then distinguish a point in the interior of each of the tiles in T by the translation equivalence between the tiles and prototiles. The canonical transversalTΩT is the set

T{TΩT: the distinguished point in the tile tT containing the origin is the origin}.

If T is repetitive, then T is a true transversal for the action of Rd on ΩT since it intersects every orbit.

Let P be a patch of T and tP be a choice of one of the tiles in that patch. The (P,t)-cylinder set is defined as

CP,t={TΩT:P is a patch in T and the distinguished point in tP is the origin},
(8)

and note that this is a subset of T. In fact, the topology of T is generated by cylinder sets of the form CP,t, and it has the structure of a Cantor set whenever T has finite local complexity. Note that for two tiles t,tP (not necessarily of the same type), there exists a vector τ=τ(P,t,t) such that φτ(CP,t)=CP,t.

For a patch P with a distinguished point in its interior, a tile tP, and ɛ > 0, the (P,t,ε)-cylinder set is the set

CP,t,ε=t<ε{φt(T):TCP,t}ΩT.
(9)

For a repetitive T of finite local complexity, the topology of ΩT is then generated by cylinder sets of the form CP,t,ε, with P being any patch in P and ɛ > 0 being arbitrarily small. This gives ΩT a local product structure of Bε(0)×C, where Bε(0)Rd is the open ball of radius ɛ and C is a Cantor set.

Let T be a repetitive tiling of finite local complexity. Given a patch PT and set BRd, let LT(P,B) be the number of copies of P completely contained inside of B. Then,

freqT(P)=limTLT(P,BT)Vol(BT),

when it exists, is the asymptotic patch frequency of P in T. For the purposes of this paper, without loss of generality, it can be assumed that this limit always exists since it will be well-defined for all tilings considered here. By (8), this gives a family of Borel measures on T parameterized by ΩT, which are invariant under the holonomies τ(P,t,t). In other words, we have a function ν:ΩT×B(T)R, where B(T) is the Borel σ-algebra of T, with ν(T,P)=freqT(P) for any patch P. The action of Rd on ΩT is uniquely ergodic if ν does not depend on the first coordinate, that is, freqT(P) is independent of T. This will be the typical case in this paper; see Solomyak (1997), Sec. 3 for further details about frequencies.

Given that the measures νTν(T,) are holonomy-invariant, by the local product structure of ΩT, they define Rd-invariant measures on ΩT which are locally of the form μT=Leb×ν, where ν is defined by the restriction the frequency measure νT on the Cantor set defined by the patch P. Whenever φs:ΩTΩT is uniquely ergodic, we will denote by μ the unique invariant measure.

This subsection introduces Lipschitz domains, which are types of subsets of Rd whose boundaries are well-behaved, making them useful sets over which to integrate functions. Let Hm denote the m-dimensional Hausdorff measure.

Definition 1.
A set ERd is called m-rectifiable if there exist Lipschitz maps fi:RmRd, i = 1, 2, …, such that
HmE\i0fi(Rm)=0.

Definition 2.
A Lipschitz domainARd is an open, bounded subset of Rd for which there exist finitely many Lipschitz maps fi:Rd1Rd, i = 1, …, L, such that
Hd1A\i=1Lfi(Rd1)=0.

Lipschitz domains have d − 1-rectifiable boundaries.

Definition 3.

A subset ARd is a good Lipschitz domain if it is a Lipschitz domain and Hd1(A)<.

A Bratteli diagramB=(V,E) is a bi-infinite directed graph partitioned such that

V=kZVk and E=kZ\{0}Ek

with maps r,s:EV satisfying r(Ek)=Vks(Ek)=Vk1 if k > 0 and r(Ek)=Vk+1s(Ek)=Vk if k < 0, and with r−1(v) ≠ and s−1(v) ≠ for all vV. We assume that |Vk| and |Ek| are finite for every k.

Remark 3.

The above definition is not the usual definition of a Bratteli diagrams, as usually their edge and vertex sets are indexed by N. One of the reasons to index the edge set E through Z̄ instead of Z is that it makes labeling choices when drawing them less awkward. The ones considered here are technically bi-infinite diagrams and the notational conventions of Lindsey and Treviño (2016) for bi-infinite Bratteli diagrams will be followed. There are two other advantages of using bi-infinite diagrams rather than the traditional diagrams indexed by N; see the first paragraph of Sec. III B for details.

The positive partB+ of B is the Bratteli diagram B+=(V+,E+) defined by the restriction to the non-negative indices of the data of B. The negative partB is similarly defined.

A path in B is a finite collection of edges ē=(e,,em) such that eiEi and r(ei) = s(ei+1) for all i ∈ {, …, m − 1}. As such, the domain of the range and source maps can be extended to all finite paths by setting s(ē)=s(e) and r(ē)=r(em). Let E,m be the set of all paths starting V to Vm, that is, finite paths ē with both s(ē)V and r(ē)Vm. We can extend this to infinite paths: let XB+=E0, be the set of infinite paths starting at V0 and XB=E,0 be the set of infinite paths ending at V0. The set XB+ can be topologized by cylinder sets of the form

C(ē)={p̄XB+:(p,,pm)=(e,,em)}
(10)

for some finite path ēE,m with 0 ≤ < m. The set XB is similarly topologized, and as such, the spaces XB±, when the number of vertices at every level is uniformly bounded (as they will be in the diagrams appearing in this paper), are compact metric spaces that are Cantor sets. The space of all bi-infinite paths on B is then

XBXB×XB+,

and it inherits the subspace topology.

Two paths p,pXB+ are tail-equivalent if there is an N > 0 such that pi=pi for all i > N and this is an equivalence relation, where we denote classes by [ē]. A minimal component of XB+ is a subset of the form [ē]̄. A Bratteli diagram B is minimal if [ē]̄=XB+ for all ēXB+ or, in other words, when there is only one minimal component. A measure μ on XB+ is invariant under the tail equivalence relation if for any N and paths p1,p2E0,N with r(p1) = r(p2), we have that μ(C(p1)) = μ(C(p2)).

Here, we recall the tiling construction from Schmieding and Treviño (2021). Let {t1, …, tM} be a set of prototiles and suppose that they admit N substitution rules F1,,FN. Given a collection F={F1,,FN} of substitution rules, we want to parameterize all possible tilings we can obtain by different combinations of substitutions. As such, the space that organizes all of these combinations is a σ-invariant, closed subset XFΣN={1,,N}Z̄ of the N-shift, where Z̄Z{0}, inheriting the order from Z. In this section, a procedure is described for constructing from any xXF a Bratteli diagram Bx+ and a construction assigning paths ēXB+ a tiling Tē. If all the substitution rules F1,,FN involve all prototiles, then XF=ΣN. However, if one or more of the substitution rules do not involve all prototiles, then there may be restrictions as to how one can compose them, leading to a strict subset XFΣN, which would be σ-invariant (a subshift). The reader should always keep in mind the case where all uniformly expanding substitution rules F1,,FN involve all prototiles (and so XF=ΣN); the other cases are not usually common in the literature, but they can be handled with the machinery of this paper.

Pick x=(x,x+)=(,x2,x1,x1,x2,)XF. We will start by defining the positive part Bx+ of the Bratteli diagram Bx. For k ≥ 0, Bx+ will have |Vk| be the number of tiles used in the substitution Fxk+1, that is, not the number of tiles that are tiled by the rule Fxk but the number of different tiles used in that substitution rule. (If all substitution rules F1,,FN involve all prototiles, then |Vk|=N for all k. Note that this differs from the traditional definition of a substitution rule in that traditionally it is all prototiles that are subdivided, whereas here one is allowed to only consider a subset of them and ignore the rest.) The vertices are ordered at each level so that viVk+ is identified with tni for every k. Now, starting with k = 1, consider the substitution rule Fxk. Then, for vjVk1+ and viVk+, there are r(i, j) edges from vj to vi, and we identify the corresponding map fi,j,k with the appropriate edge eEk+ and denote it by fe. Since the maps fe are contacting, they are of the form fe(x) = θex + τe for some θe ≤ 1. This notation extends to finite paths ēE0,k by fē=fekfe1.

Let ēXB+, and denote by ē|k the truncation of ē after its kth edge, that is, ē|kE0,k+. The kth approximantPk(ē) is the set

Pk(ē)=ēE0,k+r(ē)=r(ē|k)fē|k1fē(ts(ē))
(11)

viewed as a tiled patch, where the tiles are the sets fē|k1fē(ts(ē)) for a path ēE0,k+ with r(ē)=r(ē|k). The hypotheses on the maps fe guarantee that the approximants are nested, i.e., we have the inclusion of patches

{0}ts(ē)P1(ē)Pk(ē)Pk+1(ē).

Patches of the form Pk(ē) are called levelk-supertiles.

Definition 4.
For ēXBx+, the tiling Tē is the largest tiled subset of Rd such that Pk(ē) is a patch of Tē for all k and each tile of Tē is contained in all but finitely many of the approximants Pk(ē). In other words,
Tē=k>0Pk(ē).

Some care needs to be given in order to produce tilings that (1) cover all of Rd and (2) have finite local complexity, as nothing guarantees that the tiling in Tē to have either property. The first property needed is the following:

Definition 5.

A collection F={F1,,FN} of substitution rules is uniformly expanding if there exist numbers θ1, …, θN ∈ (0, 1) such that each substitution rule fi,j,kF is of the form fi,j,k(x) = θx + τi,j,k for some τi,j,kRd.

Definition 6.

A collection F={F1,,FN} of substitution rules is compatible if for any x ∈ ΣN and ē+XBx+ such that Tē defined in Definition 4 covers all of Rd, then Tē has finite local complexity.

Compatibility is automatic for d = 1. The results of Gähler et al. (2015) show that this is not asking for too much in higher dimensions. The following are standard [see Schmieding and Treviño (2021), Lemma 5]:

Lemma 1.

LetF={F1,,FN}be a collection of compatible and uniformly expanding substitution rules defined on the same set of prototiles. ForxXF, consider the Bratteli diagramBxwhere the edge setEkis defined byFxk. Then, we have the following:

  • Ifēē*XBx+, then there existsτRdsuch thatTē*=Tē+τ.

  • ΩTēonly depends on the minimal component:ΩTē=ΩTēfor allē[ē]̄.

Let X̊B+XB+ be the set of paths ē such that Tē covers all of Rd. Note that by the previous lemma, if Bx+ is minimal, then ΩTē1=ΩTē2 for any ē1,ē2XB+. In such cases, we denote the tiling space simply by ΩB, or if B is defined by a parameter xXF, we write Ωx. The following is a consequence of the previous lemma:

Corollary 1.

LetFa family ofNuniformly expanding and compatible substitutions,xXF, andBxbe a Bratteli diagram such that the setEk+inBx+is defined byFxk. Suppose thatBx+is minimal. Then, the assignmentēTēdefines a surjective, continuous mapΔ̄x:X̊Bx+x, wherexis the canonical transversal ofΩTē,ēX̊B+.

Definition 7.

A probability measure μ on ΣN is minimal if the set of x for which Bx is minimal has full measure.

Proposition 2 from Schmieding and Treviño (2021) is as follows:

Proposition 1.

LetFbe a family ofNuniformly expanding and compatible substitutions,xXF, andBx+be a minimal Bratteli diagram such that the setEk+inBx+is defined byFxk. Suppose thatμ(X̊B+)=1for any probability measureμonXB+, which is invariant under the tail equivalence relation. Then, the mapΔ̄xin Corollary 1 provides a bijection between measuresμonXB+, which are invariant under the tail equivalence relation, and measures onx, which are holonomy-invariant.

Proposition 2.

LetFbe a family ofNuniformly expanding and compatible substitutions andμbe a minimal, ergodicσ-invariant Borel probability measure onXF. Then, forμ-almost everyxXF, we have that there is a unique probability measureμxonXBx+, which is invariant under the tail equivalent relation. Moreover, we have thatμx(X̊Bx+)=1and there is a uniqueRd-invariant probability measure on Ωx.

Proof.
For xXF, define λ:XFR by
λx=lim supklog|E0,kx|k
for all xXF, where |E0,kx| is the number of paths from V0 to Vk on Bx. Note that this is a σ-invariant function, so it is constant μ-almost everywhere. Denote by λμ this value and AμXF the full μ-measure set such that λx = λμ for all xAμ.
Let xAμ ∩ supp μ be a Poincaré recurrent point, and let Bx be the corresponding Bratteli diagram. By minimality, there exists a k∗ > 0 such that for any vV0+ and wVk*+, there is a path p̄E0,k*+ with s(p̄)=v and r(p̄)=w. Let UxXF be the cylinder set defined by Ux={yΣ̄N:yi=xi for all i=1,,k*}, and note that μ(Ux) > 0. Let ki → ∞ be the sequence of first return times to Ux for x. That is, σki(x)Ux for all i > 0 and σk(x) ∉ Ux if kki for some i. Note that by the definitions of Ux, ki, and k∗, there is a positive matrix Mx such that the number of paths between vVki+ and wVki+k*+ is given by Mx(v, w). Let λPF denote the Perron–Frobenius eigenvalue of Mx. Then, for any ɛ, there exists a Cɛ such that for vVk+ with kik′ < ki+1, we have that
|E0,ki+|Cελxeεi.
(12)
Since μ(Ux) > 0, it follows from the estimate above that λμ ≥ log λPFɛ for any ɛ > 0, so λμ > 0. Hence, for any ɛ > 0, there is a Cɛ so that |E0,k+|Cεe(λμε)k for all k > 0. It follows from this, minimality, and recurrence of x that for the two quantities
λminv{v1,,vM}lim infklog|Ev+|k and λ+maxv{v1,,vM}lim supklog|Ev+|k,
we have that λ = λ+λPF > 0. That μ(X̊Bx+)=1 now follows by Schmieding and Treviño (2021), Lemma 3, for any Borel probability measure μ, which is invariant under the tail-equivalence relation. That there is a unique such measure follows from the main result of Treviño (2018), so the uniqueness of an invariant measure on Ωx follows from Proposition 1.□

There are two advantages of using bi-infinite Bratteli diagrams as opposed to the usual diagrams indexed by N. The first is that the path space of a bi-infinite diagram Bx parameterizes all tilings in a tiling space Ωx in a continuous way (see Proposition 3 in Sec. III B) and not just the ones associated with canonical transversals, as it happens with traditional (one-sided) Bratteli diagrams. This permits one to transfer properties back and forth between the path space of the bi-infinite diagram and the corresponding tiling space (see Proposition 1). The second and more important advantage is that one can shift the labels of a diagram Bx to obtain a diagram Bσ(x), and this process is equivariant with a homeomorphism of tiling spaces Φx : Ωx → Ωσ(x). Having x belong to a two-sided shift allows this operation to be invertible, which will allow for the semi-invertible Oseledets theorem to be applied in Sec. V A.

FIG. 3.

The associated graph iterated functions systems associated with the substitution rule in Fig. 1.

FIG. 3.

The associated graph iterated functions systems associated with the substitution rule in Fig. 1.

Close modal
FIG. 4.

The Bratteli diagram Bx for any xC([00.10]) looks like this around V0.

FIG. 4.

The Bratteli diagram Bx for any xC([00.10]) looks like this around V0.

Close modal
FIG. 5.

Mapping a cylinder set of the positive part to a cylinder set on the canonical transversal.

FIG. 5.

Mapping a cylinder set of the positive part to a cylinder set on the canonical transversal.

Close modal
FIG. 6.

Mapping a cylinder set of the negative part to a “cylinder set” of a prototile.

FIG. 6.

Mapping a cylinder set of the negative part to a “cylinder set” of a prototile.

Close modal
FIG. 7.

Mapping a cylinder set to a cylinder set.

FIG. 7.

Mapping a cylinder set to a cylinder set.

Close modal
FIG. 8.

The mechanism of renormalization: the process of applying the inverse σ−1 of the shift corresponds to applying the substitution and expansion rule defined by the edge set E1 on Bx. This shifts levels on Bx to obtain Bσ1(x) and maps level-k supertiles to level-(k + 1), as shown with the second approximant supertile from Fig. 5. At the level of cylinder sets defined by the finite path in bold from Fig. 7, we have that Φσ11(Δx(C(ē)))=Δσ1(x)(C(σ1(ē))).

FIG. 8.

The mechanism of renormalization: the process of applying the inverse σ−1 of the shift corresponds to applying the substitution and expansion rule defined by the edge set E1 on Bx. This shifts levels on Bx to obtain Bσ1(x) and maps level-k supertiles to level-(k + 1), as shown with the second approximant supertile from Fig. 5. At the level of cylinder sets defined by the finite path in bold from Fig. 7, we have that Φσ11(Δx(C(ē)))=Δσ1(x)(C(σ1(ē))).

Close modal

Consider a minimal measure μ and note that being minimal is a σ-invariant property: Bx is minimal if and only if Bσ(x) is. As such, for an σ-invariant ergodic Borel probability measure μ, the set of minimal diagrams Bx has either full or null measure.

Let

X̊B={(x,x+)XB:x+X̊B+}.

Proposition 3.

LetFbe a family ofNuniformly expanding and compatible substitutions on a set of prototiles, and suppose thatBxis minimal. Then, the mapΔ̄xfrom Corollary 1 extends to a continuous surjective mapΔx:X̊BΩx.

Proof.

Let ē=(e,e+)X̊Bx. The discussion leading to Corollary 1 shows how e+X̊Bx+ determines a point in the canonical transversal xΩx=ΩTe+. It is left to show what role e plays.

What e determines is a vector τe so that Δ(ē)=φτe(Te+), and this is done as follows (there is a concrete example worked out in Sec. IV, in case the reader would find that helpful as they read the construction). Consider the tile t containing the origin in Te+. The assumptions about the substitution rules imply that the origin is in the interior of this tile, and it can be subdivided according to the substitution rule Fx1 into |r−1(vt)| ≥ 1 tiles, where vtV0 is the vertex identified with the tile t containing the origin. The edge e−1 corresponds to a choice of one of the smaller tiles that make up t. Now, Fx2 gives a rule for subdividing this tile into |r−1(s(e−1))| ≥ 1 smaller tiles, and the edge e−2 corresponds to choosing one of the smaller tiles in this subdivision. Carrying on recursively, after ending up with a small connected subset at level −k, the substitution rule Fxk1 yields a collection of smaller pieces that make up this connected subset and the edge ek−1 of ē determines a choice of one of the smaller pieces. Since S(ē)c, on average, the pieces are contracting at a rate of eck. Thus, performing this procedure infinitely many times yields a unique point pet. The vector τe is now defined to be the unique vector that takes petTe+ to the origin. That is, the point φτe(pe)=0. This assignment can readily be seen to be continuous.□

Let Bx be a Bratteli diagram determined by a family of substitution rules F1,,FN and a point xXF. There is a natural homeomorphism hx:XBxXBσ(x) defined by the shifting of indices in XBx by 1. This yields a homeomorphism of tiling spaces, which is proved by Schmieding and Treviño (2021) (Proposition 6).

Proposition 4.

LetF={F1,,FN}be a family of uniformly expanding and compatible substitution rules, and suppose thatBxisminimal. The shiftσ:XFXFinduces a homeomorphism of tiling spaces Φx : Ωx → Ωσ(x)satisfying Φx◦Δx = Δσ(x)hx. In addition, level-ksupertiles onTēΩxare mapped to level-k − 1 supertiles onΦx(Tē)=Tσ(ē)Ωσ(x).

Before proceeding to the second, more technical part of this paper, I will take the time to relate the example in Fig. 1 to the constructions of tilings from Bratteli diagrams in Sec. III and to the renormalization procedure in Sec. III B.

Figure 1 illustrates part of two different substitution rules on six different prototiles, which are rotated copies of the half-hexagon prototile illustrated in Fig. 1 by 2πk/6, k = 1, …, 5. The substitution rules for the rest of the prototiles in these cases are then defined by looking at the substitution for the prototile in Fig. 1 and rotating them by 2πk/6, k = 1, …, 6. The graphs for the corresponding graph iterated function systems that define the substitution rules as in (4) are illustrated in Fig. 3.

To connect this more concretely with the substitution rule expressed in (4), we take each prototile as a subset of R2 with its barycenter at the origin (note that this choice will define the canonical transversal). Each edge in the graphs of Fig. 3 corresponds to a contracting linear map from (4), which places a scaled copy of a prototile inside another prototile, and so we can express the subset of R2 corresponding to a prototile as the union of images of contracting linear maps, i.e., as in (4).

Given that these two substitution rules are primitive, for any point x ∈ Σ2, we obtain a minimal Bratteli diagram Bx where the edge information Ek is given by the graph on the left in Fig. 3 if xk = 0 and otherwise by the graph on the right. Consider now a point x ∈ Σ2 where x = (…, x−2, x−1.x1, x2, …) = (…, 0, 0.1, 0, …) ∈ C([00.10]), where the dot (.) denotes the break between the negative and positive parts and C([w]) ⊂ Σ2 denotes the obvious cylinder set in Σ2 defined by the word w defined for a specific set of indices. Figure 4 illustrates the common part of a Bratteli diagram Bx for any xC([00.10]).

Consider now the positive part Bx+ of the Bratteli diagram Bx for xC([00.10]) and its associated path space XBx+, and consider a path ē+=(e1,e2,)XBx+, the first two edges of which are outlined in bold blue in the left part of Fig. 5. This path defines both a cylinder set C((e1,e2))XBx+ as in (10), as well as a second approximant P2(ē) as in (11), which is denoted on the right part of Fig. 5. As such, it also denotes cylinder sets CP2(ē+),b, where b is the distinguished point corresponding to the barycenter of the tile. In fact, using the continuous map Δ̄x from Corollary 1, it follows that Δ̄xC((e1,e2))=CP2(ē+),b.

Now consider the negative part Bx. A finite path ē=(e,,e1) on Bx defines a cylinder set C(ē)XBx, as well as a measurable subset of the prototile associated with the vertex r(ē)V0. This subset is precisely fe1fe(ts(ē))tr(ē), where fi is the contracting map associated with the edge eiEi and tr(e) is the prototile corresponding to the vertex r(e)V0. As such, the blue path ē=(e1,e2) denoted in bold blue in Fig. 6 defines a cylinder set C(ē)XBx and, on the right, the associated subset denoted in blue on the tile.

Putting Figs. 5 and 6 together, one obtains a path ē=(e2,e1,e1,e2) that defines a cylinder set C(ē)XBxXBx×XBx+. The image of this cylinder set under the map Δx:X̊BxΩx from Proposition 3 is a cylinder set in Ωx, although not of the canonical form as in (9). In any case, the cylinder set Δx(C(ē)) is described as all the tilings in Ωx having a patch around the origin, which is a translation copy of P2(ē+) in Fig. 5, and where the origin is somewhere in the blue region of Fig. 6. This is illustrated in Fig. 7.

It remains to illustrate how renormalization works in this example. As described in Sec. III B, renormalization is driven by the shift σ : Σ2 → Σ2. Figure 8 illustrates what a step of renormalization does to the cylinder set in Fig. 7. The illustration uses the inverse of the shift, as it shows the relationship between renormalization and the substitutions encoded in Bx.

A multimatrix algebra is a *-algebra of the form

M=M1Mn,

where M denotes the algebra of × matrices over C. Let M1=M1,1Mn,1 and M2=M1,2Mn,2 be multi-matrix algebras, and suppose ϕ:M1M2 is a unital homomorphism of M1 into M2. Then, ϕ is determined up to unitary equivalence in M2 by a n,2 × n,1 non-negative integer matrix Aϕ [Davidson (1996), Sec. III 2]. It follows that the inclusion of a multi-matrix algebra M0 into a larger multimatrix algebra M1 is determined up to unitary equivalence by a matrix A0, which roughly states how many copies of a particular subalgebra of M0 goes into a particular subalgebra of M1.

Let B be a Bratteli diagram, and let Ak+, kN, be the connectivity matrix at level k. In other words, Ak(i,j)+ is the number of edges going from vjVk1 to viVk. An analogous matrix Ak can be defined for k < 0. Starting with M0=C|V0|, the matrices Ak± define two families of inclusions i|k|±:M|k|1±M|k|± (up to unitary equivalence), one for + and one for −, where each Mk± is a multimatrix algebra. More explicitly, if

Mk±=Mn1±Mnk±,

then starting with the vector h0=(1,,1)TC|V0| and defining hk,+=Ak+hk1,+=Ak+A1+(h0)T for k ≥ 0 and hk,=hk1,Ak=h0A1Ak for k ≤ 0, we have that

Mk+=Mh1k,+Mhnkk,+ and Mk=Mh1k,Mhnkk,,

and the inclusions i|k|±:M|k|1±M|k|± are defined up to unitary equivalence by the matrices Ak±. With these systems of inclusions, one can define the inductive limits

LF(B+)kMk+=lim(Mk+,ik+),LF(B)kMk=lim(Mk,ik),
(13)

which are *-algebras called the locally finite (LF) algebras defined by B. Their C∗-completions

AF(B+)LF(B+)̄,AF(B)LF(B)̄

are the approximately finite-dimensional (AF) algebras defined by B.

Definition 8.

A trace on a *-algebra A is a linear functional τ:AC that satisfies τ(ab) = τ(ba) for all a,bA. [There is no assumption that traces are poitive, that is, τ(aa*) > 0.] The set of all traces of A forms a vector space over C, and it is denoted by Tr(A). A cotraceτ′ is an element of the dual vector space Tr*(A)Tr(A)*.

For M, the algebra of × matrices, Tr(M) is one-dimensional and generated by the trace τ:ai=1aii. For a multimatrix algebra M=M1Mn, the dimension of Tr(M) is n and is generated by the traces τiTr(Mi) for i = 1, …, n.

Let ik+:Mk1+Mk+ be the family of inclusions defined by the positive part of a Bratteli diagram B+. Then, there is a dual family of inclusions ik*:Tr(Mk+)Tr(Mk1+) [and an analogous family ik*:Tr(Mk)Tr(Mk1)]. The trace spaces of the LF algebras defined by a Bratteli diagram B are then the inverse limits

Tr(B+)Tr(LF(B+))=lim(ik*,Tr(Mk+)),Tr(B)Tr(LF(B))=lim(ik*,Tr(Mk)),
(14)

which are vector spaces. The respective spaces of cotraces are then

Tr*(B+)=lim((ik*)*,Tr*(Mk+)) and Tr*(B)=lim((ik*)*,Tr*(Mk)).

Remark 4.

Note that since every class [p] of the dimension group K0(AF(B+)) can be represented by an element pLF(B+), the set Tr(B+) also defines the dual space Tr(K0(AF(B+)))K0(AF(B+)). As such, the trace spaces that will be used can be thought of as the dual of the invariant K0(AF(B+)).

Let {Bx} be a family of Bratteli diagrams parameterized by xX ⊂ ΣN, where X is a closed, σ-invariant subset of ΣN (an example of this is XF, where F is a family of substitutions on N tiles, as described in Sec. III B). In what follows, we will focus on the invariants defined by the positive part of Bx, so we will drop the + superscripts used earlier. The shift induces a *-homomorphism σ*:M0xM0σ(x) as follows: For a=(a1,,a|V0+|)M0x, consider its image i1xa=((i1xa)1,,(i1xa)|V1+|)M1x. Composing this with the evaluation by T1x, which takes a=(a1,,a|V1|)M1x to T1x(a)=(τ1(a1),,τ|V1+|(a|V1+|))M0σ(x), we obtain the map

σ*=T1xi1x:aτ1(i1xa),,τ|V1+|(i1xa)=jajA1(1,j),,jajA1(|V1|,j)=A1(a1,,a|V0|)TM0σ(x)=C|V1|.

As such, the map σ*:M0x=C|V0|C|V1|=M0σ(x) coincides with the linear map A1:C|V0|C|V1| defined by the first matrix of the Bratteli diagram. As such, there is a dual map σ*:Tr(M0σ(x))Tr(M0x), and so we have the isomorphisms

Tr(Bx+)limTrM0σk(x),σ* and Tr*(Bx+)limTr*M0σk(x),σ*.
(15)

Now consider the composition σ*σ*=T1σ(x)ixσ(x)T1xi1x:M0xM0σ2(x). Since both Tr(M1σ(x)) and Tr(M2x) are isomorphic to C|V2+| and there is a canonical correspondence between their bases {τ1,,τ|V2+|} and {τ1,,τ|V2+|}, respectively, we have that

τi1σ(x)T1xi1x(a)=τi2xi1x(a)

for all {1,,|V2+|}. Hence, we can now write the composition in detail as follows:

T1σ(x)ixσ(x)T1xi1x(a)=τ1i1σ(x)T1xi1x(a),,τ|V2+|i1σ(x)T1xi1x(a)=τ1i2xi1x(a),,τ|V2+|i2xi1x(a)=i2xi1x*τ1(a),,i2xi1x*τ|V2+|(a)=A2A1*τ1(a),,A2A1*τ|V2+|(a),

where we have abused notation slightly in using τ to denote both the th canonical trace in Tr(M2x) and the one in Tr(M1σ(x)). This immediately generalizes to

σ*(k)σ*σ*:M0xM0σk(x) defined by aAkA1*τ1(a),,AkA1*τ|Vk+|(a).
(16)

Let F be a family of substitution rules on the set of prototiles t1, …, tM, and let XF be the subshift that it defines.

Definition 9.

The trace bundlep:Tr(F)XF is the bundle over XF, where p1(x)=Tr(M0x) for all xXF. The cotrace bundleq:Tr*(F)XF is the dual of the trace bundle, where q1(x)=Tr*(M0x) for all xXF.

Definition 10.

The trace cocycle is the bundle map Θ:Tr*(F)Tr*(F) defined by Θx : (x, τ′) ↦ (σ(x), σ*(τ′)) for all xXF, τTr*(M0x).

Since Tr*(M0x) is a finite dimensional vector space, we endow it with a norm ‖·‖. Note that for all yXF close enough to x, we will have Tr*(M0x)=Tr*(M0y), and thus, all these spaces inherit the same norm. With a norm in every space Tr(M0x), we now appeal to Oseledets theorem. Let ‖·‖op be the operator norm. Since the maps σ* can be singular but the base transformation σ:XFXF is invertible, we can appeal to the semi-invertible Oseledets theorem (Froyland et al., 2013) and obtain a decomposition of the trace spaces, which is invariant under the dynamics.

Theorem 4

[semi-invertible Oseledets theorem (Froyland et al., 2013)]. LetFbe a family of substitution rules ont1, …, tMtiles andμbe a minimal andσ-invariant Borel ergodic probability measure onXF. Suppose thatlog+σ*opLμ1. Then, there exist numbersλ1±λ2±λr±±, whereλi+>0andλi0, such that forμ-almost everyx, there is a measurable,σ*-invariant family of subspacesVj±(x),V(x)Tr*(M0x):

  • We haveTr*(Bx+)=Ex+Ex, where
    Ex±=i=1r±Vi±(x)andTr*(M0x)=Tr*(Bx+)V(x).
  • σ*Vj±(x)=Vj±(σ(x))andσ*V(x) ⊂ V(σ(x)).

  • For anyv±Vi±(x)andv0V(x), we have that
    limnlogσ*(n)v±n=λi± and limnlogσ*(n)v0n=.

The collection of numbers λi± associated with the measure μ are the Lyapunov exponents of μ. The set of all exponents is the Lyapunov spectrum ofμ. Given an invariant measure μ satisfying the hypotheses of Oseledets theorem, an Oseledets-generic or Oseledets-typical point is a point x for which the conclusions of the theorem hold.

In (i) of the above theorem, we have made the identification of the cotrace space Tr*(Bx+) with subspace of Tr*(M0x), which consists of vectors that are not in the kernel of σ*(k) for all k > 0. This is justified by (15). Thus, the restriction of σ* to Tr*(Bx+) is the linear map on the cotrace space induced by the shift σ. There is an analogous, dual, invariant decomposition of Tr(Bx+) as Tr(Bx+)=Tx+Tx, where

Tx±=i=1r±Ti±(x),andTr(M0x)=Tr(Bx+)T(x).

The rest of this section is devoted to defining, for Oseledets-typical points x ∈ ΣN, a map jx+:Tr*(Bx+)LF(Bx+) and deducing its equivariant properties with respect to the renormalization dynamics, that is, with respect to the shift map σ : ΣN → ΣN, which is given by (20). These properties will be used in Sec. VI in the study of ergodic integrals.

Denote by {τ1,,τ|V0+|} the standard basis of Tr(M0x) and by {δ1,,δ|V0+|} the dual basis for Tr*(M0x). Oseledets theorem above gives a canonical identification of Tr*(Bx+) with a subspace of Tr*(M0x), so any cotrace in Tr*(Bx+) can be written as

τ*=i=1|V0+|βi(τ*)δiTr*(Bx+)Tr*(M0x).
(17)

We now define a map

jx+:Tr*(Bx+)LF(Bx+)AF(Bx+)
(18)

as follows: For τ*Tr*(Bx+), the image [aτ*]=[jx+(τ*)] is defined through its representative in M0x,

jx+(τ*)=β1(τ*),,β|V0+|(τ*)i=1|V0+|C=M0x,
(19)

which is well-defined by expression (17). We denote by [aτ*]=[jx+(τ*)] its class in LF(Bx+). Note that by (16), we have that

jσ(x)+(σ*v)=τ1(i1xjx+v),,τ|V1+|(i1xjx+v)C|V1+|=M0σ(x),

where τ is the canonical generator for Tr(Mn), the trace space for the th summand of the multimatrix algebra M1x. In general, (16) gives

jσk(x)+(σ*(k)v)=τ1(ikxi1xjx+(v)),,τ|Vk+|(ikxi1xjx+(v))=σ(k)*τ1(jx+(v)),,σ(k)*τ|Vk+|(jx+(v))C|Vk+|=M0σk(x),
(20)

where σ(k)* is the dual to σ*(k).

This section is devoted to the proof of the main result of this paper (Theorem 1). First, some necessary notions are introduced and some estimates derived. Then, in Sec. VI A, a proof of the upper bound (2) in Theorem 1 is derived. This is followed by the construction of special averaging sets in Sec. VI B and a proof of (1) in Theorem 1.

Throughout this section, we assume that we are working with a minimal, ergodic σ-invariant Borel probability measure on XF and that the collection F of substitutions are uniformly expanding and compatible. Throughout this section, we also assume that xXF is an Oseledets typical, Poincaré recurrent point. Let

X̊Bx0ēX̊B:Δx(ē)x.

Definition 11.

Let F be a family of substitution tilings on the tiles t1, …, tM, and let Ωx=Δx(X̊Bx) be the tiling space given by the minimal Bratteli diagram Bx. A spanning system of patches for Ωx is a collection Γ={Γk}k0 of sets of patches Γk={Pv}vVk+ with the following properties: for each vVk+, there is a path ēv=(ēv,ēv+)=(,e2,e1,e1,e2,)X̊Bx0 with r(ēv+|k)=v, and in that case, Pv=Pk(ēv+).

A spanning system of patches gives a catalog of all the supertiles in a given space. Along with this catalog, we can find a subset of the tiling space itself, which corresponds to each of the patches in this catalog. More specifically, given a spanning system of patches Γ, there is a corresponding system of plaques. For each patch Pv given by the system Γ, the corresponding plaque in Ωx is

PvtPvφt(Tēv)Ωx.

We will denote by XBΓX̊B0 the set of paths parameterized by V+, which give the spanning system of patches Γ.

Let L(Ωx) be the set of Lipschitz functions on Ωx, and for each fL(Ωx), denote by Lf the Lipschitz constant. Given a spanning system of patches Γ, we define for fL(Ωx) and each kN, the vector

VΓk(f)=Pv1fds̄,,Pv|Vk+|fds̄=Pv1fφsTev1+ds,,Pv|Vk+|fφsTev|Vk+|+dsC|Vk+|,
(21)

where ds̄ is the natural, leafwise volume form on Ωx. In words, the vectors are obtained by integrating the function f along level-k super tiles of all possible types, and we use the plaques Pvi given by the spanning system of patches. This will allow us to know how the function integrates along bigger and bigger orbits.

Since dimTr*(M0σk(x))=|Vk+|, there is a canonical isomorphism between Tr*(M0σk(x)) and C|Vk+|, taking the dual of the generator τiTr(Mi) to the ith standard basis vector in C|Vk+| for all i=1,,|Vk+|, where M0σk(x)=M1M|Vk+|. As such, we can think of each VΓk(f,ē) as an element of Tr*(M0σk(x)), and we can compare VΓk+1(f,ē) with σ*VΓk(f,ē). The ith component of the difference is

(VΓk+1(f,ē)σ*VΓk(f,ē))i=PvifφsTevi+dser1(vi)Ps(e)fφsTes(e)+ds.
(22)

Let ε(0,λ1+). Since each patch Pv for vVk+1+ is the union of patches given by level-k supertiles, for any edge eEk+1+, the transverse distance between the plaques Pr(e) and Ps(e) is

d(Pr(e),Ps(e))Cεe(λ1+ε)k,
(23)

where the constant Cɛ is independent of e and only depends on the family F,μ and ɛ. For viVk+ and er−1(vi), let

Pvi,efēv|k1feeE0,k1+:r(e)=s(e)fe(ts(e)).

As such, there are the decompositions of each Pvi as patches tiled by level-k − 1 supertiles,

Pvi=er1(vi)Pvi,e and Pvi=er1(vi)Pvi,e,
(24)

so it follows that

PvifφsTevi+dser1(vi)Ps(e)fφsTes(e)+ds=er1(vi)Pvi,efφsTevi+dsPs(e)fφsTes(e)+ds.
(25)

Since both of the terms

Pvi,efφsTevi+ds and Ps(e)fφsTes(e)+ds

are integrating f along pieces of leaves, which correspond to the patches given by level-(k − 1) supertiles, and the distance between these pieces is at most Cεe(λ1+ε)k, we can use the Lipschitz property to bound

Pvi,efφsTevi+dsPs(e)fφsTes(e)+dsLfCεe(λ1+ε)kPvi,efφsTevi+ds
(26)

for any er−1(vi). Returning to (22) and using (23)–(26),

(VΓk+1(f,ē)σ*VΓk(f,ē))ier1(vi)Pvi,efφsTevi+dsPs(e)fφsTes(e)+dser1(vi)LfCεe(λ1+ε)kPvi,efφsTevi+er1(vi)LfCεe(λ1+ε)kVol(Ps(e))fer1(vi)Cf,εe(λ1+ε)ke(λ1++ε)kfCf,ε,Fe2εk,
(27)

where we have used that Vol(Ps(e))e(λ1++ε)k, which follows from the fact that Vol(Ps(e)) is roughly the number of tiles in the level-k supertile Ps(e), which is exactly τs(e) (ik, …, i1(Id)), and this is bounded by the largest growth rate of the trace cocycle.

By the estimate above, we have that for any ɛ > 0,

VΓk+1(f,ē)σ*VΓk(f,ē)Cε*e2εk

for all k > 0, so we can now invoke Bufetov’s approximation Lemma (Bufetov, 2014, Lemma 2.8), which says that given a sequence of matrices {Θk} defined by a cocycle and sequence of vectors {Vk} such that ‖Vk+1 − ΘkVk‖ ≤ Cϵeϵk, then there exists a vector v* on the first vector space whose orbit shadows the vectors Vk at an exponential scale: ΘkΘ1v*Vk+1Cϵeϵk.

Applied to our situation, by (26) and Bufetov’s approximation Lemma, there exists a af,ΓEx+Tr*(Bx+)Tr*(M0x) with the property that

jσk+1(x)+σ*(k)af,ΓVΓk+1(f)Cεe2εk
(28)

for all k > 0. Thus, we get a map

iΓ+:L(Ωx)Tr*(Bx+)

with iΓ+(f)=af,Γ as defined above for any fL(Ωx). By composition with the map jx+ in (18), we get a map jx+ix+:L(Ωx)LF(Bx+).

For a tiling T of Rd of finite local complexity and a good Lipschitz domain B with nonempty interior, we denote by T · B the set (TId)B and by OT(B) all the tiles of T, which are completely contained in B.

Given x ∈ ΣN, denote by θ(n)x=θxnθxn1θx1 the product of the contracting constants from the substitution maps. In other words, θxi is the contraction constant of the substitution map Fxi. The following was proved by Schmieding and Treviño (2021) (Lemma 8).

Lemma 2.
For a good Lipschitz domainBwith nonempty interior, tilingTēΩxandT > 0, there exists an integern = n(T, B) and a decomposition
OTē(TB)=i=0nj=1M(i)k=1κj(i)tj,k(i),
(29)
wheretj,k(i)is a level-isupertile of typejwith
  • κj(n)0for somejandVol(TB)K1θ(n)xd,

  • j=1M(i)κj(i)K2Vol((TB))θ(i)xd1fori = 0, …, n − 1, and

  • R1θ(n)x1<T<R11R2θ(n)x1andn(R2T, B) > n(T, B)

for someK1, K2, R1, R2 > 0.

Let B be the Lipschitz domain and T > 1. For TēΩx, consider a level-i super tile tj,k(i) of type j given by the decomposition given in Lemma 2 and fL(Ωx). For any ɛ > 0 and spanning system Γ, as in (27), one has that

tj,k(i)fφs(Tē)dsPvjfφs(Tēvj)dsCεLfe2εi
(30)

with vjVi+. Combining this with (28), we have that

tj,k(i)fφs(T)dsjσi(x)+σ*(i)iΓ+(f)jCεe2εi,
(31)

where Cε only depends on ɛ and F.

For any Oseledets regular x and a generating trace τx,kTr(M0σk(x)), there is a decomposition

τx,k=m±=1dμ±bm±,,kτm,k±+b,,kτ,k,

where τm,k±Tm±(σk(x)) and τ∞,kT(σk(x)) are unit vectors. Note that in such decomposition, there is a N such that |bm±,,k|N for all indices. This follows from the fact that τm,k± are unit vectors, τx,k are generating traces (i.e., unit vectors), and we are dealing with finite dimensional vector spaces. Since iΓ+(f)Ex+, using (29) and (20), it follows that

OTē(TB)fφs(Tē)ds=i=0n(T)j=1M(i)k=1κj(i)tj,k(i)fφs(Tē)ds=i=0n(T)j=1M(i)κj(i)jσi(x)+σ*(i)iΓ+(f)j+O(e2εi)=i=0n(T)j=1M(i)κj(i)σ(i)*τjx,ijx+iΓ+(f)+O(e2εi)=i=0n(T)j=1M(i)κj(i)m=1dμ+bm,,iσ(i)*τm,i+jx+(iΓ+(f))+O(e2εi)=i=0n(T)j=1M(i)κj(i)m=1dμ+bm,,iσ*(i)|Vm+(x)τm,0+jx+(iΓ+(f))+O(e2εi).
(32)

For any ɛ > 0, the bounds in Lemma 2 give

OTē(TB)fφs(Tē)dsi=0n(T)j=1M(i)κj(i)C1m=1dμ+τm,0+jx+(iΓ+(f))e(λm++ε)iC2i=0n(T)Vol((TB))θ(x)id1m=1dμ+τm,0+jx+(iΓ+(f))e(λm++ε)iC3i=0n(T)(θxi+1,,θxn)1dm=1dμ+τm,0+jx+(iΓ+(f))e(λm++ε)i,
(33)

where the fact that Vol((TB))(θe1θei)d1C3(θxi+1θxn)1d was used. This last estimate is a straightforward consequence of the estimates in Lemma 2 and the fact that Vol((TB))Vol(TB)d1d for Lipschitz domains B and large T. If τm,0+(jx+(iΓ+(f)))=0 for all m = 1, …, r − 1 but τr,0+(jx+(iΓ+(f)))0 for some rdμ+, then

OTē(TB)fφs(Tē)dsC4i=0n(T)(θxi+1θxn)1dτr,0+[af]e(λr++ε)i.
(34)

Now, for any ɛ > 0, we have that

(θxi+1θxn)1dCεeλ1+d+ε(ni)(d1)

for some Cɛ′ > 0. Indeed, for an Oseledets-typical xXF, the leading exponent λ1+ gives the exponential rate of increase in the number of paths starting from V0+ of length k > 0 in Bx+. Since the paths of length k are in bijection with tiles in k-approximants, the number of paths of length k also gives estimates on the volumes of patches for level-k supertiles. Thus, λ1+ gives the exponential rate of increase in the volume of supertiles. Hence,

limnlogθx1θxnn=λ1+d.
(35)

Therefore, we can continue with (33),

OTē(TB)fφs(Tē)dsC5i=0n(T)eλ1+d+ε(ni)(d1)e(λr++ε)i=C5i=0n(T)eλ1+d+ε(in)(1d)e(λr++ε)i=C5i=0n(T)expλr+λ1+d1d+ε(2d)i+λ1+d1d+ε(d1)n=C5expλ1+d1d+ε(d1)ni=0n(T)expλr+λ1+d1d+ε(2d)i=C6expλ1+d1d+ε(d1)n1expλr+λ1+d1d+ε(2d)n+1C7expmaxλ1+d1d+ε(d1),λr++εn.
(36)

Defining

λ̄r,ε+maxλ1+d1d+ε(d1),λr++ε

and using (iii) from Lemma 2, we have that

logOTē(TB)fφs(Tē)dslogTlogC7+λ̄r,ε+n(T)log(R11)+logθ(x)n1.
(37)

Recall that by (35), we have that

limnlogθ(x)n1n=limn1ni=1nlogθxi1=λ1+d,

so it follows from (37) that

lim supTlogOTē(TB)fφs(Tē)dslogTlim supnlogC7+λ̄r,ε+n(T)log(R11)+logθ(x)n1=λ̄r,ε+λ1+d.
(38)

Now, since

TBfφs(Tē)dsOTē(TB)fφs(Tē)ds+TBOTē(TB)fφs(Tē)dsC8eλ̄r,ε+n(T)+O((TB))=C8eλ̄r,ε+n(T)+O(Td1),
(39)

this completes the proof of the bound (2).

Let xXF be a Poincaré-recurrent, Oseledets-regular point, and TēΩx for some ē=(ē,ē+)=(,e2,e1,e1,e2,)X̊Bx. For any ɛ > 0, there exists a Tɛ > 0 such that

  • T1OTē(TB) is ɛ-close to B in the Hausdorff metric,

  • OTē contains a ball of radius twice the minimal radius so that every ball of such radius contains a copy of every prototile in its interior

for all T > Tɛ. Pick some T* > Tɛ, and define Bε=T*1OTē(T*B) and Pε(ē)=T*Bε=OTē(T*B), which is a patch for all tilings in Ωx. The set Bɛ is at most ɛ close to B in the Hausdorff metric.

Let ki → ∞ denote the recurrence times, σki(x)x, and suppose that σki(ē) converges to ē*=(,e2*,e1*,e1*,e2*,)X̊Bx along these times. Let kx be the smallest integer so that for all vV0+ and wVkx+, there is a path pE0,kx+ with s(p) = v and r(p) = w. It follows that there is a kɛ′ ≥ kx and finite set of paths EBεE0,kε+ such that for all pEBε, one has that r(p)=r(ē|kε) and such that the patch Pε(ē) decomposes as

Pε(ē)=φτēēEBεfē|kε1fē(ts(ē))φτēPkε(ē+),
(40)

where τēRd is completely determined by the negative part of ē. By the choice of T*, the patch Pε(ē) is decomposed as the union of tiles

Pε(ē)==1Mj=1κ()t,j,
(41)

where t,j is a translate of the prototili t. Note that the number of tiles in the decomposition (41) is |EBε| from (40).

By minimality, there is a smallest kɛ > kɛ′ such that there is a path pEkε,kε with s(p)=r(ē|kε) and r(p)=r(ē*|kε). This gives a finite set of paths EBεE0,kε+ obtained by concatenating p′ to every path eEε. As such, the patch decomposes as

Pε(ē)=φτēēEBεfē|kεp1fē(ts(ē)).

Considering the patch

Pε*(ē)=ēEBεfē*|kε1fē(ts(ē))Pkε(ē*+),

by Lemma 1, there is a τē,ē*Rd such that Pε*(ē)=Pε(ē)+τē,ē*.

Let me take the time here to describe what is about to be done. So far, we have constructed a set Bɛ that is ɛ-close to B, but it is of a special type: when dilated by T*, it becomes a patch that has been denoted by Pε(ē). Now, since x is Poincaré recurrent, there is a sequence of times ki → ∞ such that all the tilings in Ωσki(x) admit Pε(ē) as a patch since σki(x)x. Recall that by Proposition 4 patches in Ωσki(x) correspond to “superpatches” in Ωx, that is, patches in Ωx made up of level-ki supertiles. Hence, we want to dilate Pε(ē) along a sequence of times Ti so that up to a small translation, it becomes a patch made up of only level-ki supertiles, unlike general dilations of sets that, as Lemma 2 shows, involve supertiles of all levels. We do all this because the integrals along this sequence of superpatches can be controlled very well.

For all i large enough, the set Eki,ki+kε+ is a copy of E0,kε+, and as such, it contains a copy EBεi of EBε. In other words, since Ek+ is determined by Fxk and xki+j=xj for all large i and 0 < jkɛ (by Poincaré recurrence), we can make the identification Eki+j+=Ej+ for all large i. Moreover, since kɛkx, for i large enough, there is a path from v to r(ēki+kε) for all vVki+. Define the patches

Pεi(ē)evEBεiēE0,kis(ev)=r(ē)fē|ki+kε1fēev(ts(ē)),
(42)

and note that

Pεi(ē)=evEBεiēE0,kis(ev)=r(ē)fē|ki+kε1fēev(ts(ē))=evEBεiēE0,kis(ev)=r(ē)fē|ki+kε1fevfē(ts(ē))=evEBεiēE0,kis(ev)=r(ē)fē|ki1f(eki+1,,eki+kε)1fevfē(ts(ē))=fē|ki1evEBεiēE0,kis(ev)=r(ē)fē*|kε1fevfē(ts(ē))=fē|ki1evEBεfē*|kε1fev(ts(ev))=fē|ki1(Pε*(ē))=fē|ki1Pε(ē)+τē,ē*=fē|ki1T*Bε+τē,ē*.
(43)

Thus, setting t,j(i)fē|ki1(t,j+τē,ē*), by (41), it follows that

Pεi(ē)==1Mj=1κ()t,j(i),

which expresses Pεi(ē) as the union of level-ki supertiles of Tē.

Lemma 3.

There is a compact setKRdsuch that for allilarge enough, there exists aTi > 0 andτiKsuch thatTi(Pε(ē)+τi)=Pxi(ē).

Proof.
By (43), we have that
Pεi(ē)=fē|ki1T*Bε+τē,ē*=θ(ki)x1T*Bε+τē,ē*i
for some τē,ē*iRd. Defining Tiθ(ki)x1T*, we have that Pεi(ē)=TiBε+τē,ē*i. By our assumption of recurrence, we have that there exists a Rɛ such that for all i large enough, the patch Pε(ē) is found in any ball of radius Rɛ around any point in Rd for any TΩσki(x) for all i large enough. The scaling Ti relates the scales of Ωx and those of Ωσki(x). In other words, level-ki supertiles in Ωx correspond to tiles in Ωσki(x), and the difference in scales is precisely Ti. By this relationship of scale and repetitivity, any ball of radius TiRɛ in Tσki(ē) contains a copy of the patch Pεi(ē). Hence, without loss of generality, we can assume that τē,ē*iBTiRε(0). Letting τi=Ti1τē,ē*i, we get that Ti(Pε(ē)+τi)=Pxi(ē).

1. Implicit upper bound

Let fL(Ωx). By (43), for all i large enough, there is the decomposition

Pεi(ē)fφs(Tē)ds==1Mj=1κ()t,j(i)fφs(Tē)ds,

which, after choosing ɛ′ > 0 and using (30) and (31), becomes, as in (32),

Pεi(ē)fφs(Tē)ds==1Mκ()jσki(x)+σ*(ki)iΓ+(f)+O(e2εki)==1Mκ()σ(ki)*τjx,kijx+(iΓ+(f))+O(e2εki)==1Mκ()m=1dμ+bm,,kiσ(ki)*τm,ki+jx+iΓ+(f)+O(e2εki)==1Mκ()m=1dμ+bm,,kiσ*(ki)|Vm+(x)τm,0+jx+(iΓ+(f))+O(e2εki).
(44)

Hence, if τm,0+jx+(iΓ+(f))=0 for all m < r but τr,0+jx+(iΓ+(f))0,

Pεi(ē)fφs(Tē)ds==1Mκ()m=rdμ+bm,,kiσ*(ki)|Vm+(x)τm,0+[af]+O(e2εki)
(45)

for all i, from which it follows that

Ti(Bε+τi)fφs(Tē)dsCe(λr++ε)ki

for all i. Since Ti is proportional to θ(ki)x1, we can estimate as in (34)–(38) to obtain

lim supilogTi(Bε+τi)fφs(Tē)dslogTiλr++ελ1+d.

2. Implicit lower bound

We partition the set of indices {1, …, M} into two sets I+, I0. An index is in I+ if

lim supijσki(x)+σ*(ki)iΓ+(f)σ*kiπ,x+iΓ+f>0

and I0 otherwise, where we recall that π,x+:Tr*(M0x)V+(x) is the corresponding projection to the th positive Oseledets subspace. The set I+ is not empty because (1) by assumption, τ+([af])=0 for all < r and τr+([af])0, meaning that π,x+iΓ+f=0 for all < r but πr,x+iΓ+f0; and (2) all norms are equivalent in finite dimensional vector spaces.

Now, we recall (44) and express it with indices according to the partition I+, I0,

Pεi(ē)fφs(Tē)ds=I+κ()jσki(x)+σ*(ki)iΓ+(f)+I0κ()jσki(x)+σ*(ki)iΓ+(f)+O(e2εki),

which, after rearranging, using the triangle inequality, and rearranging again, we get

Pεi(ē)fφs(Tē)dsI+κ()jσki(x)+σ*(ki)iΓ+(f)I0κ()jσki(x)+σ*(ki)iΓ+(f)+O(e2εki)C+σ*kiπr,x+iΓ+f
(46)

for all i and some C+ > 0 small enough. Recalling that Ti is proportional to θ(ki)x1 and using (35),

lim supilogPεi(ē)fφs(Tē)dslogTilim supilogC+σ*kiπr,x+iΓ+flogTi=lim supikilogTilogσ*kiπr,x+iΓ+fki=dλ1+λr+.
(47)

For a function f:XR on a Cantor set X and a clopen subset CX, define

Var(f,C)supx,yC|f(x)f(y)|,

and for a partition P = {P1, …, Pn} of X into disjoint clopen subsets, define

Var(f,P)=i=1nVar(f,Pi).

A Cantor set naturally carries a metric structure. In fact, Cantor sets carry ultrametric structures, and so any ball Bϵ(x) ⊂ X is a clopen set. Let dX:X2R be an ultrametric on X. For any set CX, let diam C = sup{dX(x, y) : x, yC}. Let Pϵ be the set of all partitions {P1, …, Pk} of X by clopen sets with diam Piϵ for all i. Finally, let

Varϵ(f)=supPPϵVar(f,P) and Var(f)=supϵ>0Varϵ(f).

A function f:XR on a Cantor set X has bounded variation if Var(f) < ∞. Note that if f is a locally constant function on a Cantor set, then Var (f) = 0, so it is of bounded variation.

Definition 12.

Let Ω be the tiling space of an aperiodic, repetitive tiling of finite local complexity. A continuous function f:ΩR has bounded variation if there is a Vf < ∞ such that Var(f|) ≤ Vf for all transversals ⊂ Ω, which are Cantor sets.

The set of continuous functions on Ω with bounded variation is denoted by BV(Ω). Note that if f is a transversally locally constant function, then it is in BV(Ω). Let q̄=(q1,q2,)NN, where qk > 1 for all k. For any such q̄ we will denote q(n) = q1, …, qn.

Definition 13.

A d-dimensional solenoid is the tiling space Ωq̄ associated with a family of substitutions F on a single prototile t1=12,12d. The Bratteli diagram Bq̄ for such tiling spaces have a single vertex at every level and |Ek|=qkd for all kZ, and it is also required here that θe=qkd for any eEk. In this case, the family F is allowed to be infinite.

Remark 5.

The definition for a solenoid above is slightly more general than the usual definition of a solenoid as an inverse limit of Td under maps of the form qn · Id.

The goal of this section is to prove a type of bound known as a Denjoy–Koksma inequality (Herman, 1979, Sec. VI 3) for solenoids.

Theorem 5
(Denjoy–Koksma inequality for solenoids). LetΩq̄be ad-dimensional solenoid. Then, for anyfBV(Ωq̄)andpΩq̄,
[0,qn]dfφs(p)dsq(n)dΩq̄fdμVar(f)
for alln > 0.

Remark 6.

It seems reasonable to conjecture that a Denjoy–Koksma inequality holds for any tiling space Ωx obtained from compatible and uniformly expanding substitutions with AF(Bx+) is UHF [see Davidson (1996), Sec. III 5]]. It seems like for d = 1, the proof below can be combined with the usual intertwining arguments to give a proof.

Proof.

Let Xq̄+XBq̄+. Since any substitution in the family F forces the border, the map Δq̄:Xq̄+q̄ is a homeomorphism of Cantor sets. As such, the topology of q̄ is generated by the image of cylinder subsets of Xq̄+ under the map Δq̄, and the ultrametric structure of q̄ is inherited from that of Xq̄. As such, for every k > 0, there are q(k)d pairwise-disjoint cylinder sets Cikq̄, parameterized by i{1,,q(k)}d, one for each path pE0,k, whose union is q̄. Moreover, since it is well known that XBq̄+ admits a unique tail-invariant Borel probability measure, by Proposition 1, we have that diamCik=ν(Cik)=q(k)d for all i for the unique holonomy-invariant measure ν on q̄.

For any ē=(ē,ē+)Xq̄, the kth approximant Pk(ē+) is a tiled cube of side length q(k) containing the origin, and it is tiled by q(k)d tiles isometric to [0,1]d. For Tē=Δq̄(ē)Ωq̄, there exists a vector τē12,12d such that φτē(Tē)q̄. By Lemma 1, there exist q(k)d vectors τ1,,τq(k)d such that φτi(Tē)Cik. In other words, the points {φτi(Tē)}iq(k)d-equidistribute in q̄.

In fact, more is true: the vectors τ1,,τq(k)d can be chosen to be nice elements of Zd. In particular, one can choose them to be the elements of the set {0,,q(k)1}d. First, note that for any s{0,,q(k)1}d, φs+τē(Tē)q̄. This follows from the fact that there is a single prototile (a unit cube) in the tiling and its center is the puncture. Thus, since φτē(Tē)q̄, it follows that φs+τē(Tē)q̄. Moreover, for any ss{1,,q(k)}d, it follows that Δq̄1(φs+τē(Tē))|kΔq̄1(φs+τē(Tē))|k, so they q(k)d-equidistribute in q̄.

Now recall the proof of the classical Denjoy–Koksma inequality for the dynamics restricted to q̄ (Herman, 1979, Theorem VI.3.1). For ēq̄,
i0,,q(k)1dfφi(Tē)q(k)dq̄fdν=i0,,q(k)1d1ν(Cik)Cikfφi(Tē)f(x)dν(x)i0,,q(k)1d1ν(Cik)Cikfφi(Tē)f(x)dν(x)i0,,q(k)1dsupy,zCik|f(y)f(z)|i0,,q(k)1dVar(f,Cik)Varq(k)d(f).
(48)
Up to this point, everything has been done with reference to the transversal at zero q̄. It turns out that for every point y0,1d, there is an associated transversal q̄yΩq̄ obtained by translating q̄=q̄0 by y. By composition with this translation, the map Δq̄ is a homeomorphism between Xq̄+ and q̄y, and so for any k > 0, there is a partition {Cik(y)}i of q̄y by q(k)d cylinder sets of measure νy(Cik(y))=q(k)d, where the measure νy on q̄y is the translate of the measure ν on q̄. Thus, the same arguments leading to (48) hold for the transversal q̄y, and so it follows that for Tēq̄y,
i0,,q(k)1dfφi(Tē)q(k)dq̄yfdνyVarq(k)d(f).
(49)
Finally, note that if pΩq̄ and y0,1d such that pq̄y, then
[0,qk]dfφs(p)ds=0,1di0,,q(k)1dfφi+s(p)ds.
Putting it all together, let pΩq̄ and y0,1d such that pq̄y. Then,
[0,qk]dfφs(p)dsqkdΩq̄fdμ=0,1di0,,q(k)1dfφi+s(p)dsq(k)d0,1dq̄φs(y)fdνφs(y)ds0,1di0,,q(k)1dfφi+s(p)q(k)dq̄φs(y)fdνφs(y)ds0,1dVarq(k)d(f)ds=Varq(k)d(f)Var(f).
(50)

This section will focus on applications of the results of Sec. VI to algebras of operators coming from the tiling spaces obtained by collections of substitution rules. Although it is natural in such cases to focus on the C∗-algebras of operators obtained, here the focus is on *-algebras, which are dense in the C∗-algebras of usual interest. This is because the traces obtained are only densely defined and one loses all but one trace by going to the completion C∗-algebras. This is mentioned for the curious reader wondering how one completes the algebras constructed; it is not relevant for the work here. However, the reader can see, for example, Bellissard (1986) for how the use of operator algebras enters the study of aperiodic media from a mathematical physics point of view; see also Kellendonk and Putnam (2000) and Lenz and Stollmann (2003) for several uses of C∗-algebras in the study of tilings. The *-algebras used here will be dense subalgebras of the ones used in Lenz and Stollmann (2003).

For a family F of uniformly expanding and compatible substitutions defined on the same set of prototiles and xXF, let Bx be the associated Bratteli diagram as constructed in Sec. III and assume Bx is minimal. Recall that by construction, any tile t on any tiling TΩ has a distinguished point in its interior, and they correspond to the placement of the origin inside of the prototiles {t1, …, tM}. These distinguished points are called punctures in Kellendonk (1995). Once the punctures have been chosen in the interior of the prototiles, there exists a ϱ > 0 such that any ball of radius less than ϱ centered at the puncture of a tile tTΩx does not intersect the boundary of t, and this holds for all xXF and TΩx. Let ΛT be the set of punctures of T, that is, the union of all distinguished points of all tiles of T, and define

Gx(p,T,q)Rd×Ωx×Rd:p,qΛT.

Definition 14.

A kernel of finite range is a function kC(Gx) such that we have the following:

  • k is bounded.

  • k has finite range. In other words, there is a Rk > 0 such that k(p,T,q)=0 whenever |pq| > Rk.

  • k is Rd-invariant: k(pt,φt(T),qt)=k(p,T,q) for any tRd.

The set of all kernels of finite range associated with Ωx are denoted by Kxfin. For any kKxfin, there is a family of representations {πT}TΩx in B(2(ΛT)) defined, for kKxfin, by

KTδp,δq=(πTk)δp,δq=k(p,T,q).

The family {KT} parameterized by Ωx is bounded in the product TΩxB(2(ΛT)). Defining a convolution product as

(ab)(p,T,q)=xΛTa(p,T,x)b(x,T,q)

and involution by k*(p,T,q)=k(q,T,p)̄, Kxfin has the structure of a *-algebra. It follows that the map π:KxfinTB(2(ΛT)) is a faithful *-representation. The image is denoted by Axfin, and it is the algebra of operators of finite range. The completion of this algebra is denoted by Ax.

Definition 15.

The set of Lipschitz kernels of finite range consists of kernels kKxfin for which there are constants Rk, Lk > 0 such that if for two T1,T2Ωx, one has that BRk(0)ΛT1=BRk(0)ΛT2, then for any p,qBRk(0)ΛT1, one has that |k(p,T1,q)k(p,T2,q)|Lkd(T1,T2).

The kernels in the above definition carry the label Lipschitz since they will be connected to Lipschitz functions on the tiling space Ωx; see Lemma 4.

The set of Lipschitz kernels of finite range is denoted by LKxfinKxfin. The image of LKxfin is denoted by LAxfin=πLKxfinAxfin, and it is the set of Lipschitz operators of finite range. It should be pointed out that most operators of interest in mathematical physics, such as operators of the form H = Δ + V, where V is a “localized” potential on defined on T, are contained in the set LAxfin. A simple example to consider in one dimension is as follows. Let T be a tiling of R by N different tile types and ΛT be the collection of endpoints of tiles of T. There is an obvious, order-preserving labeling of Λ by Z. For i ∈ {1, …, N} and λ ≠ 0, consider the operator Hi,λ = Δ + λVi, where Δ is the discrete Laplacian on Z and the localized potential Vi is defined by Vi(p) = p if p ∈ Λ is a left endpoint of a tile of type i and otherwise Vi(p) = 0. Similar constructions can be made for tilings in higher dimensions by considering the graph GT given by the Delaunay triangulation of ΛT, considering the graph Laplacian GT on GT, and considering an operator of the form H=GT+V, where V is a localized potential depending only on the local pattern around pΛT.

Let u:RdR be a smooth non-negative (bump) function of integral 1, compactly supported in a disk of radius less than ϱ. This defines a family of functions wu,T:LAxfinC(Rd) parameterized by Ωx as follows: For A=πkAxfin and AT=πTkB(2(ΛT)), let fATu be defined by

fATu(t)=wu,T(A)(t)=pΛTAT(p,p)u(pt).

Lemma 4.

For anyALAxfinandTΩx, there exists a Lipschitz functionh=hAuL(Ωx)such thatfATu(t)=hφt(T).

Proof.
The assignment TfATu(0) defines a function fAu(0):xR. For T,Tx, one then has for any kLKxfin,
fATu(0)fATu(0)=k(0,T,0)k(0,T,0)u(0)u(0)Lkd(T1,T2),
so this is a Lipschitz function on ℧x with the Lipschitz constant Lku(0).

The function TfAu(0) can be extended to Ωx by choosing a neighborhood U of ℧x of size ru and a product chart ϕu:UBru(0)×x, and noting that the function defined by h=ϕu*ū, where ū(t,T)=fATu(0)u(t) with ‖t‖ < ru, defines a Lipschitz function on Ωx. That this gives fATu(t)=hφt(T) follows from the Rd invariance of the kernel k used to define A.□

Let Mu:LAxfinL(Ωx) be the map given by Lemma 4, and denote the composition ϒu,Γjx+iΓ+Mu:LAxfinLF(Bx+). We can define functionals τi:LAxfinC by pullback τi=ϒu,Γ*τi+, i.e., τi(A)=τi+(ϒu,Γ(A)), for ALAxfin, where τi+Ti+(x). The functionals τi may or may not be traces. By Schmieding and Treviño (2018b), Proposition 1, we know some cases when they are.

Proposition 5.
LetF1,,FNbe a collection of uniformly expanding and compatible substitution rules on a set of prototilest1, …, tMandμbe a minimal,σ-invariant ergodic Borel probability measure onXF. Then, forμ-almost everyx, for a spanning system of patches Γ on Ωx, the functionalτi=ϒu,Γ*τi+is a trace ifλi+λ1+>d1d. Hence, ϒuinduces a map on traces
ϒu,Γ*:Tr(Bx+)++Tr(LAxfin),
whereTr(Bx+)++is the subspace ofTr(Bx+)generated by tracesτi+, which satisfyλi+λ1+>d1d.

Let dμ++ be the dimension of the subspace Tr(Bx+)++. Define the dμ++ traces in Tr(LAxfin) to be {τ1,,τdμ++}, where τiϒu,Γ*Ti+(x) is any non-zero element. Now pick ATLAxfin, a good Lipschitz domain B and T > 0. First, note that for two smooth bump functions u, u′ of compact support in a ball of radius less than ρ and integral 1, it follows that

OT(E)MuAφt(T)MuAφt(T)dt=0, and EMuAφt(T)MuAφt(T)dt=O(|E|)
(51)

for any measurable E of finite volume. In addition, it follows that

trAT|OT(E)OT(E)MuAφt(T)dt=0,tr(AT|E)EMuAφt(T)dt=O(|E|)
(52)

for any measurable set E of finite volume, where the second estimate is from Schmieding and Treviño (2018b), Eq. (22). Thus, if τi(A) = 0 for all i = 1, …, r for some r<dμ++ but τr(A) ≠ 0, by (36), it follows that for any ɛ > 0,

|tr(AT|TB))|=TBMuAφt(T)dt+O((TB))maxCε,Aτr(A)Tdλr+λ1++dε,O(Td1)
(53)

independent of which bump function u was used by (51). Thus, by (38) and (39), if dλr+(d1)λ1+, then

lim supTlog|tr(AT|TB)|logTλr+λ1+d.

For ɛ′ > 0, we choose a set Bɛ as in Sec. VI B along with the sequence of times Ti → ∞ and vectors τiRd. By construction, Ti(Bε+τi)=OT(Ei), where EiRd is some measurable subset of finite volume. Thus, the results of Sec. VI B along with (51) and (52) imply that

lim supilog|tr(AT|Ti(Bε+τi))|logTi=λr+λ1+d.

Let me close by giving some experimental results. Consider the two substitution rules on the half hexagons in Fig. 1 in the Introduction and which were studied in Sec. IV. The first substitution rule depicted is the classical substitution rule in the half-hexagon with expansion constant 2. The eigenvalues of the corresponding substitution matrix are 4, 2, 1, 1, −1, −1. The second substitution rules has expansion constant 4, and the eigenvalues for the corresponding substitution matrix are 16,7±i3,2,2,2. Note that |7±i3|>4=16, so the second substitution rule has “rapidly expanding” eigenvalues.

For p ∈ (0, 1), let μp be the Bernoulli measure on Σ2, which gives the cylinder set μp(C1) = p and μp(C2) = 1 − p, where Ci = {x ∈ Σ2 : x1 = i}. The typical points for the measure μp then give tiling spaces Ωx, which are obtained from tilings that were constructed, on average, by applications of the first substitution in Fig. 3 with probability p and the second substitution from Fig. 3 with probability 1 − p. Note that from the graphs in Fig. 3, it is easy to recover the two matrices that are used to compute the trace cocycle.

Figure 9 shows the (normalized) spectrum as a function of p. It is normalized because what is plotted are the ratios 2λi+/λ1+, which are the relevant exponents in the main results of this paper. Perhaps not surprisingly, when p > 1/2, there seems to be a pair of (normalized) Lyapunov exponents greater than 1, meaning that there are non-trivial deviations of ergodic averages for tilings in a typical tiling space Ωx with respect to the measure μp. In particular, as pointed out in the first item of Remark 2, this shows the rate of convergence in the Shubin–Bellissard formula for the integrated density of states for any Lipschitz kernels of finite range.

FIG. 9.

Lyapunov spectrum for the measures μp as a function of p.

FIG. 9.

Lyapunov spectrum for the measures μp as a function of p.

Close modal

I am deeply grateful to Lorenzo Sadun who pointed out a mistake in an earlier version of this paper and to Dan Rust for helpful discussions, especially bringing Godrèche and Luck, 1989 to my attention. I am also grateful to an anonymous referee for suggestions, which made the exposition of this paper much better. This work was supported by NSF Grant No. DMS-1665100.

The data that support the findings of this study are available from the corresponding author upon reasonable request.

1.
Baake
,
M.
and
Grimm
,
U.
,
Aperiodic Order: Volume 1, A Mathematical Invitation
, Encyclopedia of Mathematics and its Applications Vol. 149 (
Cambridge University Press
,
Cambridge
,
2013
), with a foreword by R. Penrose.
2.
Bellissard
,
J.
, “
K-theory of C*-algebras in solid state physics
,” in
International Conference on the Mathematical Aspects of Statistical Mechanics and Field Theory, Groningen, 1985
, Lecture Notes in Physics Vol. 257 (
Springer
,
Berlin
,
1986
), pp.
99
156
.
3.
Berthé
,
V.
and
Delecroix
,
V.
, “
Beyond substitutive dynamical systems: S-adic expansions
,” in
Numeration and Substitution 2012
, RIMS Kôkyûroku Bessatsu Vol. B46 (
Research Institute for Mathematical Sciences (RIMS)
,
Kyoto
,
2014
), pp.
81
123
.
4.
Bowen
,
R.
and
Franks
,
J.
, “
Homology for zero-dimensional nonwandering sets
,”
Ann. Math.
106
(
1
),
73
92
(
1977
).
5.
Bufetov
,
A. I.
, “
Limit theorems for suspension flows over Vershik automorphisms
,”
Russ. Math. Surv.
68
(
5
),
789
(
2013
).
6.
Bufetov
,
A. I.
, “
Limit theorems for translation flows
,”
Ann. Math.
179
(
2
),
431
499
(
2014
).
7.
Bufetov
,
A. I.
and
Solomyak
,
B.
, “
Limit theorems for self-similar tilings
,”
Commun. Math. Phys.
319
(
3
),
761
789
(
2013
).
8.
Cosentino
,
S.
and
Flaminio
,
L.
, “
Equidistribution for higher-rank Abelian actions on Heisenberg nilmanifolds
,”
J. Mod. Dyn.
9
,
305
353
(
2015
).
9.
Damanik
,
D.
,
Embree
,
M.
, and
Gorodetski
,
A.
, “
Spectral properties of Schrödinger operators arising in the study of quasicrystals
,” in
Mathematics of Aperiodic Order
, Progress in Mathematical Physics Vol. 309 (
Birkhäuser; Springer
,
Basel
,
2015
), pp.
307
370
.
10.
Davidson
,
K. R.
,
C∗-Algebras by Example
, Fields Institute Monographs Vol. 6 (
American Mathematical Society
,
Providence, RI
,
1996
).
11.
Forni
,
G.
, “
Deviation of ergodic averages for area-preserving flows on surfaces of higher genus
,”
Ann. Math.
155
(
1
),
1
103
(
2002
).
12.
Frank
,
N. P.
and
Sadun
,
L.
, “
Fusion: A general framework for hierarchical tilings of Rd
,”
Geom. Dedicata
171
,
149
186
(
2014
).
13.
Froyland
,
G.
,
Lloyd
,
S.
, and
Quas
,
A.
, “
A semi-invertible Oseledets theorem with applications to transfer operator cocycles
,”
Discrete Contin. Dyn. Syst.
33
(
9
),
3835
3860
(
2013
).
14.
Gähler
,
F.
,
Kwan
,
E. E.
, and
Maloney
,
G. R.
, “
A computer search for planar substitution tilings with n-fold rotational symmetry
,”
Discrete Comput. Geom.
53
(
2
),
445
465
(
2015
).
15.
Gähler
,
F.
and
Maloney
,
G. R.
, “
Cohomology of one-dimensional mixed substitution tiling spaces
,”
Topol. Appl.
160
(
5
),
703
719
(
2013
).
16.
Godrèche
,
C.
and
Luck
,
J. M.
, “
Quasiperiodicity and randomness in tilings of the plane
,”
J. Stat. Phys.
55
(
1-2
),
1
28
(
1989
).
17.
Herman
,
M.-R.
, “
Sur la conjugaison différentiable des difféomorphismes du cercle à des rotations
,”
Publ. Math. Inst. Hautes Sci.
49
,
5
233
(
1979
).
18.
Horan
,
J.
, “
Asymptotics for the second-largest Lyapunov exponent for some Perron-Frobenius operator cocycles
,”
Nonlinearity
34
,
2563
(
2021
).
19.
Kellendonk
,
J.
, “
Noncommutative geometry of tilings and gap labelling
,”
Rev. Math. Phys.
7
(
7
),
1133
1180
(
1995
).
20.
Kellendonk
,
J.
and
Putnam
,
I. F.
, “
Tilings, C*-algebras, and K-theory
,” in
Directions in Mathematical Quasicrystals
, CRM Monograph Series Vol. 13 (
American Mathematical Society
,
Providence, RI
,
2000
), pp.
177
206
.
21.
Lenz
,
D.
and
Stollmann
,
P.
, “
Algebras of random operators associated to Delone dynamical systems
,”
Math. Phys. Anal. Geom.
6
(
3
),
269
290
(
2003
).
22.
Lenz
,
D.
and
Stollmann
,
P.
, “
An ergodic theorem for Delone dynamical systems and existence of the integrated density of states
,”
J. Anal. Math.
97
,
1
24
(
2005
).
23.
Lindsey
,
K.
and
Treviño
,
R.
, “
Infinite flat surface models of ergodic systems
,”
Discrete Contin. Dyn. Syst.
36
(
10
),
5509
5553
(
2016
).
24.
Rust
,
D.
, “
An uncountable set of tiling spaces with distinct cohomology
,”
Topol. Appl.
205
,
58
81
(
2016
), part of Special Issue: The Pisot Substitution Conjecture.
25.
Rust
,
D.
and
Spindeler
,
T.
, “
Dynamical systems arising from random substitutions
,”
Indag. Math.
29
(
4
),
1131
1155
(
2018
).
26.
Sadun
,
L.
,
Topology of Tiling Spaces
, University Lecture Series Vol. 46 (
American Mathematical Society
,
Providence, RI
,
2008
).
27.
Sadun
,
L.
, “
Exact regularity and the cohomology of tiling spaces
,”
Ergodic Theory Dyn. Syst.
31
(
6
),
1819
1834
(
2011
).
28.
Schmieding
,
S.
and
Treviño
,
R.
, “
Self affine Delone sets and deviation phenomena
,”
Commun. Math. Phys.
357
(
3
),
1071
1112
(
2018a
).
29.
Schmieding
,
S.
and
Treviño
,
R.
, “
Traces of random operators associated with self-affine Delone sets and Shubin’s formula
,”
Ann. Henri Poincare
19
(
9
),
2575
2597
(
2018b
).
30.
Schmieding
,
S.
and
Treviño
,
R.
, “
Random substitution tilings and deviation phenomena
,”
Discrete Contin. Dyn. Syst.
41
(
8
),
3869
(
2021
).
31.
Solomyak
,
B.
, “
Dynamics of self-similar tilings
,”
Ergodic Theory Dyn. Syst.
17
(
3
),
695
738
(
1997
).
32.
Treviño
,
R.
, “
Flat surfaces, Bratteli diagrams and unique ergodicity à la Masur
,”
Israel J. Math.
225
(
1
),
35
70
(
2018
).
33.
Zorich
,
A.
, “
How do the leaves of a closed 1-form wind around a surface?
,” in
Pseudoperiodic Topology
, American Mathematical Society Translations: Series 2 Vol. 197 (
American Mathematical Society
,
Providence, RI
,
1999
), pp.
135
178
.