Skip to main content
Acta Crystallographica Section A: Foundations and Advances logoLink to Acta Crystallographica Section A: Foundations and Advances
. 2022 Aug 12;78(Pt 5):437–451. doi: 10.1107/S2053273322006714

Pure discrete spectrum and regular model sets on some non-unimodular substitution tilings

Jeong-Yup Lee a,*
Editor: M I Aroyob
PMCID: PMC9434600  PMID: 36047401

The equivalence between pure discrete spectrum and regular model sets on some non-unimodular substitution tilings is established. This will help to provide useful information about the cut-and-project scheme used in the description of quasiperiodic structures.

Keywords: pure discrete spectrum, regular model sets, non-unimodular substitution, Pisot family substitution, Meyer sets

Abstract

Substitution tilings with pure discrete spectrum are characterized as regular model sets whose cut-and-project scheme has an internal space that is a product of a Euclidean space and a profinite group. Assumptions made here are that the expansion map of the substitution is diagonalizable and its eigenvalues are all algebraically conjugate with the same multiplicity. A difference from the result of Lee et al. [Acta Cryst. (2020), A76, 600–610] is that unimodularity is no longer assumed in this paper.

1. Introduction

There has been considerable success in studying the structure of tilings with pure discrete spectrum by setting them in the context of model sets (Baake & Moody, 2004; Baake et al., 2007; Strungaru, 2017; Akiyama et al., 2015). However, in general settings, the relation between pure discrete spectrum and model sets is not completely understood and the cut-and-project scheme is usually constructed with an abstract internal space (Baake & Moody, 2004; Strungaru, 2017). Thus it is not easy to understand this relation concretely and get information about the structure from the relation. The notion of inter model sets was introduced by Baake et al. (2007) and Lee & Moody (2006) and we know the equivalence between pure discrete spectrum and inter model sets in substitution tilings (Lee, 2007). But there are still some limitations in getting useful information about the cut-and-project scheme (CPS) because the internal space was constructed abstractly. What is the internal space concretely? There was some progress in this direction by Lee et al. (2018) and Lee, Akiyama & Lee (2020). However, these papers make various assumptions about substitution tilings such as the expansion map is diagonalizable, the eigenvalues of the expansion map should be algebraically conjugate, the multiplicity of the eigenvalues should be the same, and the expansion map is unimodular. From a long perspective, we aim to gradually eliminate assumptions one by one. As a first step, in this paper we eliminate the assumption of unimodularity.

Our work was inspired by an example of Baake et al. (1998), which offers a guide to what the internal space should be. We will look at this in Example 5.10. The present paper is an extension of the result of Lee, Akiyama & Lee (2020) in the sense that the unimodularity condition is removed, and the setting is quite similar.

There are various research works on non-unimodular substitution cases (Baker et al., 2006; Ei et al., 2006; Siegel, 2002) that study symbolic substitution sequences or their geometric substitution tilings in dimension 1. Our definition of non-unimodularity looks slightly different from that defined in those papers. However, if we restrict the substitution tilings to one dimension Inline graphic , the two definitions are the same.

We have four basic assumptions about a primitive substitution tiling Inline graphic on Inline graphic with an expansion map ϕ:

(i) ϕ is diagonalizable.

(ii) All the eigenvalues of ϕ are algebraically conjugate.

(iii) All the eigenvalues of ϕ have the same multiplicity.

(iv) Inline graphic is rigid [see (14) for the definition].

We call these assumptions DAMR. This paper relies heavily on the rigid structure of substitution tilings, and the rigidity property is only known under those assumptions (i), (ii), (iii) together with finite local complexity (Theorem 2.9). In Section 2, we review some definitions and known results that are going to be used in this paper. The main result of this paper shows the following:

Theorem 1.1

Let Inline graphic be a repetitive primitive substitution tiling on Inline graphic with a diagonalizable expansion map ϕ whose eigenvalues are algebraic conjugates with the same multiplicity and let Inline graphic be rigid. If Inline graphic has pure discrete spectrum, then control point set Inline graphic of each tile type is a regular model set in the CPS with an internal space which is a product of a Euclidean space and a profinite group, where Inline graphic is a control point set of Inline graphic defined in (7) and the CPS is defined in (35).

In Section 3, we give an outline of the proof of this theorem in some simple case of substitution tilings with expansion map ϕ satisfying the DAMR assumptions defined above. In Section 4, we define an appropriate internal space and construct a CPS under the DAMR assumptions. Then we discuss the projected point sets Inline graphic of neighbourhood bases of a topology in the internal space. In Section 6, under the assumption of pure discrete spectrum of Inline graphic , we look at how the projected point sets Inline graphic and the translation vector set Ξ of the same types of tiles in Inline graphic are related [see (8)]. Using the equivalent property ‘algebraic coincidence’ for pure discrete spectrum, we provide arguments to show that we actually have regular model sets.

2. Definitions and known results

We consider a primitive substitution tiling Inline graphic on Inline graphic with expansion map ϕ satisfying the DAMR assumptions defined above. In this section, we recall some definitions and results that we are going to use in the later sections.

2.1. Tilings

We consider a set of types (or colours) Inline graphic , which we fix once and for all. A tile in Inline graphic is defined as a pair Inline graphic where Inline graphic (the support of T) is a compact set in Inline graphic , which is the closure of its interior, and Inline graphic is the type of T. A tiling of Inline graphic is a set Inline graphic of tiles such that Inline graphic and distinct tiles have disjoint interiors.

Given a tiling Inline graphic , a finite set of tiles of Inline graphic is called a Inline graphic -patch. Recall that a tiling Inline graphic is said to be repetitive if the occurrence of every Inline graphic -patch is relatively dense in space. We say that a tiling Inline graphic has finite local complexity (FLC) if for every Inline graphic there are only finitely many translational classes of Inline graphic -patches whose support lies in some ball of radius R up to translations.

2.2. Delone κ-sets

A κ-set in Inline graphic is a subset Inline graphic = Inline graphic Inline graphic (κ copies) where Inline graphic and κ is the number of colours. We also write Inline graphic . Recall that a Delone set is a relatively dense and uniformly discrete subset of Inline graphic . We say that Inline graphic is a Delone κ-set in Inline graphic if each Inline graphic is Delone and Inline graphic is Delone. The type (or colour) of a point x in the Delone κ-set Inline graphic is i if Inline graphic with Inline graphic .

A Delone set Λ is called a Meyer set in Inline graphic if Inline graphic is uniformly discrete, which is equivalent to saying that Inline graphic for some finite set F (see Meyer, 1972; Lagarias, 1996; Moody, 1997). If Inline graphic is a Delone κ-set and Inline graphic is a Meyer set, we say that Inline graphic is a Meyer κ-set.

2.3. Substitutions

We say that a linear map Inline graphic is expansive if there is a constant Inline graphic with

2.3.

for all Inline graphic under some metric d on Inline graphic compatible with the standard topology.

Definition 2.1

Let Inline graphic be a finite set of tiles on Inline graphic such that Inline graphic ; we will call them prototiles. Denote by Inline graphic the set of patches made of tiles each of which is a translate of one of the Inline graphic ’s. We say that Inline graphic is a tile-substitution (or simply substitution) with an expansive map ϕ if there exist finite sets Inline graphic for Inline graphic , such that

Definition 2.1

with

Definition 2.1

Here all sets in the right-hand side must have disjoint interiors; it is possible for some of the Inline graphic to be empty.

The substitution (1) is extended to all translates of prototiles by Inline graphic , and to patches and tilings by Inline graphic . The substitution ω can be iterated, producing larger and larger patches Inline graphic . A tiling Inline graphic satisfying Inline graphic is called a fixed point of the tile-substitution or a substitution tiling with expansion map ϕ. It is known (and easy to see) (Solomyak, 1997) that one can always find a periodic point for ω in the tiling dynamical hull, i.e. Inline graphic for some Inline graphic . In this case we use Inline graphic in the place of ω to obtain a fixed point tiling. The substitution Inline graphic matrix Inline graphic of the tile-substitution is defined by Inline graphic . We say that the substitution tiling Inline graphic is primitive if there is an Inline graphic for which Inline graphic has no zero entries, where Inline graphic is the substitution matrix.

When there exists a monic polynomial Inline graphic over Inline graphic with the minimal degree satisfying Inline graphic , we call the polynomial the minimal polynomial of ϕ over Inline graphic . We say that ϕ is unimodular if the minimal polynomial of ϕ over Inline graphic has constant term Inline graphic ; that is to say, the product of all roots of the minimal polynomial of ϕ is Inline graphic . If the constant term in the minimal polynomial of ϕ is not Inline graphic , then we say that ϕ is non-unimodular.

Note that for Inline graphic ,

2.3.

where

2.3.

Definition 2.2

Inline graphic is called a substitution Delone κ-set if Inline graphic is a Delone κ-set and there exist an expansive map Inline graphic and finite sets Inline graphic for Inline graphic such that

Definition 2.2

where the unions on the right-hand side are disjoint.

Definition 2.3

For a substitution Delone κ-set Inline graphic satisfying (4), define a matrix Inline graphic whose entries are finite (possibly empty) families of linear affine transformations on Inline graphic given by

Definition 2.3

Define Inline graphic for Inline graphic . For a κ-set Inline graphic let

Definition 2.3

Thus Inline graphic by definition. We say that Φ is a κ-set substitution. Let

Definition 2.3

denote the substitution matrix corresponding to Φ.

Definition 2.4

(Mauduit, 1989.) An algebraic integer θ is a real Pisot number if it is greater than 1 and all its Galois conjugates are less than 1 in modulus, and a complex Pisot number if every Galois conjugate, except the complex conjugate Inline graphic , has modulus less than 1. A set of algebraic integers Inline graphic is a Pisot family if for every Inline graphic , every Galois conjugate η of Inline graphic , with Inline graphic , is contained in Θ.

For Inline graphic , with Inline graphic real and Inline graphic , this reduces to Inline graphic being a real Pisot number, and for Inline graphic , with Inline graphic non-real and Inline graphic , to Inline graphic being a complex Pisot number.

2.4. Pure discrete spectrum and algebraic coincidence

Let Inline graphic be the collection of tilings on Inline graphic each of whose patches is a translate of a Inline graphic -patch. In the case that Inline graphic has FLC, there is a well known metric δ on the tilings: for a small Inline graphic two tilings Inline graphic are ε-close if Inline graphic and Inline graphic agree on the ball of radius Inline graphic around the origin, after a translation of size less than ε (see Schlottmann, 2000; Radin & Wolff, 1992; Lee et al., 2003). Then

2.4.

where the closure is taken in the topology induced by the metric δ.

It is known that a dynamical system Inline graphic with a primitive substitution tiling Inline graphic always has a unique ergodic measure μ in the dynamical system Inline graphic (see Solomyak, 1997; Lee et al., 2003). We consider the associated group of unitary operators Inline graphic on Inline graphic :

2.4.

Every Inline graphic defines a function on Inline graphic by Inline graphic . This function is positive definite on Inline graphic , so its Fourier transform is a positive measure Inline graphic on Inline graphic called the spectral measure corresponding to g. The dynamical system Inline graphic is said to have pure discrete spectrum if Inline graphic is pure point for every Inline graphic . We also say that Inline graphic has pure discrete spectrum if the dynamical system Inline graphic has pure discrete spectrum.

The notion of pure discrete spectrum of the dynamical system is quite closely connected wtih the notion of algebraic coincidence in Definition 2.6. For this we start by introducing control points. There is a standard way to choose distinguished points in the tiles of a primitive substitution tiling so that they form a ϕ-invariant Delone κ-set. They are called control points (Thurston, 1989; Praggastis, 1999), which are defined below.

Definition 2.5

Let Inline graphic be a primitive substitution tiling with an expansion map ϕ. For every Inline graphic -tile T, we choose a tile Inline graphic in the patch Inline graphic ; for all tiles of the same type in Inline graphic , we choose Inline graphic with the same relative position [i.e. if Inline graphic for some two tiles Inline graphic then Inline graphic ]. This defines a map Inline graphic called the tile map. Then we define the control point for a tile Inline graphic by

Definition 2.5

The control points satisfy the following: (a) Inline graphic = Inline graphic , for any tiles Inline graphic of the same type; (b) Inline graphic , for Inline graphic .

Let

2.4.

be a set of control points of the tiling Inline graphic in Inline graphic . Let us denote Inline graphic by Inline graphic .

For tiles of any tiling Inline graphic , the control points have the same relative position as in Inline graphic -tiles. The choice of control points is non-unique, but there are only finitely many possibilities, determined by the choice of the tile map. Let

2.4.

Since the substitution tiling Inline graphic is primitive, it is possible to assume that the substitution matrix Inline graphic is positive taking Inline graphic if necessary. So we consider a tile map

2.4.

with the property that for every Inline graphic , the tile Inline graphic has the same tile type in Inline graphic . That is to say, for every Inline graphic , Inline graphic , where Inline graphic and Inline graphic . Then for any Inline graphic ,

2.4.

In order to have Inline graphic for some Inline graphic and Inline graphic , we define the tile map as follows. It is known that there exists a finite generating patch Inline graphic for which Inline graphic (Lagarias & Wang, 2003). Although it was defined there for primitive substitution point sets, it is easy to see that the same property holds for primitive substitution tilings. We call the finite patch Inline graphic the generating tile set. When we apply the substitution infinitely many times to the generating tile set Inline graphic , we obtain the whole substitution tiling. So there exists Inline graphic such that the nth iteration of the substitution to the generating tile set covers the origin. We choose a tile R in a patch Inline graphic which contains the origin, where Inline graphic for some Inline graphic . Then there exists a fixed tile Inline graphic such that Inline graphic . Replacing the substitution ω by Inline graphic , we can define a tile map γ so that

2.4.

Then Inline graphic by the definition of the control point sets and so Inline graphic . Since Inline graphic for any Inline graphic ,

2.4.

This implies that

2.4.

Definition 2.6

(Lee, 2007.) Let Inline graphic be a primitive substitution tiling on Inline graphic with an expansive map ϕ and let Inline graphic be a corresponding control point set. We say that Inline graphic admits an algebraic coincidence if there exists Inline graphic and Inline graphic for some Inline graphic such that

Definition 2.6

Note that if the algebraic coincidence is assumed, then for some Inline graphic ,

2.4.

Theorem 2.7

[Theorem 3.13 (Lee, 2007), Theorem 2.6 (Lee, Akiyama & Lee, 2020).] Let Inline graphic be a primitive substitution tiling on Inline graphic with an expansive map ϕ and Inline graphic be a control point set of Inline graphic . Suppose that all the eigenvalues of ϕ are algebraic integers. Then Inline graphic has pure discrete spectrum if and only if Inline graphic admits an algebraic coincidence.

2.5. CPS

We use a standard definition for a CPS and model sets (see Baake & Grimm, 2013). For convenience, we give the definition for our setting.

Definition 2.8

A CPS consists of a collection of spaces and mappings as follows:

Definition 2.8

where Inline graphic is a real Euclidean space, H is a locally compact Abelian group, Inline graphic and Inline graphic are the canonical projections, Inline graphic is a lattice, i.e. a discrete subgroup for which the quotient group Inline graphic is compact, Inline graphic is injective, and Inline graphic is dense in H. For a subset Inline graphic , we define

Definition 2.8

Here the set V is called a window of Inline graphic . A subset Inline graphic of Inline graphic is called a model set if Inline graphic can be of the form Inline graphic , where Inline graphic has non-empty interior and compact closure in the setting of the CPS in (12). The model set Inline graphic is regular if the boundary of W

Definition 2.8

is of (Haar) measure 0. We say that Inline graphic is a model κ-set (respectively, regular model κ-set) if each Inline graphic is a model set (respectively, regular model set) with respect to the same CPS.

2.6. Rigid structure on substitution tilings

The structure of a module generated by the control points is known only for the diagonalizable case for ϕ whose eigen­values are algebraically conjugate with the same multiplicity given by Lee & Solomyak (2012). We need to use the structure of the module in the subsequent sections. Thus we will have the same assumptions.

Let J be the multiplicity of each eigenvalue of ϕ and assume that the number of distinct eigenvalues of ϕ is m. For Inline graphic , we define Inline graphic such that for each Inline graphic ,

2.6.

We recall the following theorem for the module structure of the control point sets. Although the theorem is not explicitly stated by Lee & Solomyak (2012), it can be read off from their Theorem 4.1 and Lemma 6.1.

Theorem 2.9

(Lee & Solomyak, 2012.) Let Inline graphic be a repetitive primitive substitution tiling on Inline graphic with an expansion map ϕ. Assume that Inline graphic has FLC, ϕ is diagonalizable, and all the eigenvalues of ϕ are algebraically conjugate with the same multiplicity J. Then there exists a linear isomorphism Inline graphic such that

Theorem 2.9

where Inline graphic , Inline graphic , are given as (13) and Inline graphic Inline graphic .

Note here that Inline graphic are linearly independent over Inline graphic . A tiling Inline graphic is said to be rigid if Inline graphic satisfies the result of Theorem 2.9; that is to say, there exists a linear isomorphism Inline graphic such that

2.6.

where Inline graphic , Inline graphic , are given as (13).

As an example of a substitution tiling with the rigidity property, let us look at the Frank–Robinson substitution tiling (Frank & Robinson, 2006) (Fig. 1).

Figure 1.

Figure 1

The Frank–Robinson tiling substitution.

Take the tile-substutition

2.6.
2.6.
2.6.
2.6.

where b is the largest root of Inline graphic and

2.6.

Then it gives a primitive substitution tiling Inline graphic . Note that b is not a Pisot number. It was shown by Frank & Robinson (2006) that Inline graphic does not have FLC. One can observe that each set of translation vectors satisfies Inline graphic . Thus

2.6.

whence the rigidity holds.

3. Outline of the proof of Theorem 1.1

We provide a brief outline of the proof of Theorem 1.1 for the simpler case of repetitive primitive substitution tilings Inline graphic on Inline graphic with an expansion factor λ ( Inline graphic ):

(a) λ is non-unimodular,

(b) λ is a real Pisot number which is not an integer,

(c) Inline graphic has FLC,

(d) Inline graphic has pure discrete spectrum.

Let Inline graphic be the minimal polynomial of ϕ over Inline graphic for which Inline graphic . Let Inline graphic be all the roots of the equation Inline graphic , where the absolute values of Inline graphic are all less than 1. Using the rigidity of Theorem 2.9, we get up to an isomorphism

3.

Using the algebraic conjugates Inline graphic of λ whose absolute values are less than 1, we consider a Euclidean space Inline graphic and the map

3.

where

3.

For the case of non-unimodular λ, we construct a profinite group below. We remark that if λ is unimodular, then the profinite group is trivial so that Theorem 1.1 can be covered by the work of Lee, Akiyama & Lee (2020). Let Inline graphic . From the non-unimodularity of λ, Inline graphic . So Inline graphic . Note that Inline graphic is a basis of L as a free Inline graphic -module. Consider the map

3.

This gives an isomorphism of the Inline graphic -module between L and Inline graphic . Let

3.

be the companion matrix of Inline graphic . Then

3.

Notice that M acts on Inline graphic and the roots of the minimal polynomial of M over Inline graphic are exactly Inline graphic . Since Inline graphic , Inline graphic . Here we consider a profinite group

3.

Since Inline graphic embeds in Inline graphic , we can identify Inline graphic with its image in Inline graphic . Consider the following map:

3.

Now we construct a CPS whose physical space is Inline graphic and internal space is Inline graphic : 3.

Under the assumption of pure discrete spectrum of Inline graphic , we know that an algebraic coincidence occurs by Theorem 2.7. So there exist Inline graphic and Inline graphic for some Inline graphic such that

3.

where Ξ is the set of translational vectors which translate a tile to the same type of tile in Inline graphic as given in (8). Notice that Inline graphic is a basis element in the locally compact abelian group Inline graphic where Inline graphic is a ball of radius δ around 0 in Inline graphic . We let Inline graphic be the projected point set in Inline graphic coming from a window Inline graphic . It is important to understand the relation between Inline graphic and Ξ. We discuss this in Section 4.2 (see also Lee et al., 2018; Lee, Akiyama & Lee, 2020). From this relation, together with algebraic coincidence, we can view the control point set of Inline graphic as a model set. Using Keesling’s argument (Keesling, 1999), we show that the control point set of Inline graphic is actually a regular model set.

4. Construction of a CPS

We aim to prove that the structure of pure discrete spectrum in a substitution tiling can be described by a regular model set which comes from a CPS with the internal space that is a product of a Euclidean space and a profinite group. From Lee & Solomyak (2019), under the assumption of pure discrete spectrum, the control point set of the substitution tiling has the Meyer property and so has FLC. In general settings which are not substitution tilings, it is hard to expect that pure discrete spectrum implies neither the Meyer property nor FLC (Lee, Lenz et al., 2020).

The setting that we consider here is a primitive substitution tiling Inline graphic on Inline graphic with an expansion map ϕ which satisfies the DAMR assumptions. Changing the tile substitution if necessary, we can assume that ϕ is a diagonal matrix without loss of generality.

Under the assumption of DAMR, it is also known from Lee & Solomyak (2012, 2019) that the control point set of the substitution tiling has the Meyer property if and only if the eigenvalues of ϕ form a Pisot family. In our setting, there is no algebraic conjugate η with Inline graphic for the eigenvalues of ϕ, since ϕ is an expansion map. It is known that if ϕ is an expansion map of a primitive substitution tiling with FLC, every eigenvalue of ϕ is an algebraic integer (Kenyon & Solomyak, 2010; Kwapisz, 2016). Even for non-FLC cases, we know from the rigidity that the control point set lies in a finitely generated free abelian group L which spans Inline graphic and Inline graphic . So all the eigenvalues of ϕ are algebraic integers [Lemma 4.1 of Lee & Solomyak (2008)].

In the case of non-unimodular substitution tilings, there are two parts of spaces for the internal space of a CPS. One is a Euclidean part and the other is a profinite group part. We describe them below.

4.1. An internal space for a CPS

4.1.1. Euclidean part for the internal space

In this subsection, we assume that there exists at least one algebraic conjugate whose absolute value is less than 1, which is different from the eigenvalues of ϕ. In the case of unimodular ϕ, we can observe that there always exists such an algebraic conjugate. But in the case of non-unimodular ϕ, it is possible not to have an algebraic conjugate whose absolute value is less than 1. For example, let us consider an expansion map

4.1.1.

Then the minimal polynomial of ϕ is Inline graphic , which means that ϕ is non-unimodular. If there exists no other algebraic conjugate of the eigenvalues of ϕ whose absolute value is less than 1, one can skip this subsection and go to the next Section 4.1.2.

Recall that J is the multiplicity of the eigenvalues of ϕ, d is the dimension of the space Inline graphic , m is the number of distinct eigenvalues of ϕ and Inline graphic . We can write

4.1.1.

where Inline graphic is a real Inline graphic matrix for Inline graphic , a real Inline graphic matrix of the form

4.1.1.

for Inline graphic with Inline graphic and Inline graphic . Here Inline graphic is the Inline graphic zero matrix and Inline graphic . Then the eigenvalues of ψ are

4.1.1.

Note that m is the degree of the characteristic polynomial of ψ.

We assume that the minimal polynomial of ψ over Inline graphic has e real roots and f pairs of complex conjugate roots. Since the minimal polynomial of ψ has the characteristic polynomial of ψ as a divisor, we can consider the roots of the minimal polynomial of ψ over Inline graphic in the following order:

4.1.1.

Let

4.1.1.

We now consider a Euclidean space whose dimension is Inline graphic , whose number corresponds to the number of the other roots of the minimal polynomial of ψ which are not the eigenvalues of ψ. Let

4.1.1.

For Inline graphic , define a Inline graphic matrix

4.1.1.

where Inline graphic is a real Inline graphic matrix with the value Inline graphic for Inline graphic , and Inline graphic is a real Inline graphic matrix of the form

4.1.1.

for Inline graphic [see Lee, Akiyama & Lee (2020) for more details]. The matrix Inline graphic operates on the space Inline graphic .

Notice that ϕ and ψ have the same minimal polynomial over Inline graphic , since ϕ is the diagonal matrix containing J copies of ψ.

Let us consider now the following embeddings:

4.1.1.

where Inline graphic , Inline graphic is as in (13), Inline graphic and Inline graphic . Note that

4.1.1.

Let Inline graphic . Note that the minimal polynomial of ϕ is monic, since the eigenvalues of ϕ are all algebraic integers. So Inline graphic and

4.1.1.

is a basis of L as a free Inline graphic -module.

Now, we can define the map

4.1.1.
4.1.1.

Since Inline graphic are linearly independent over Inline graphic , the map Inline graphic is well defined. Thus Inline graphic where

4.1.1.

is a block diagonal Inline graphic matrix in which Inline graphic is an Inline graphic matrix, Inline graphic , and Inline graphic . Let Inline graphic .

4.1.2. Profinite group part for the internal space

To make the notation short, denote the basis of L given in (21) by Inline graphic . Consider a Inline graphic -module iso­morphism between L and Inline graphic

4.1.2.

where

4.1.2.

Consider the Inline graphic matrix:

4.1.2.

Since L spans Inline graphic over Inline graphic , the rank of N is d. Thus Inline graphic has only the trivial solution, where Inline graphic is the transpose of N. From Inline graphic , we can write, for each Inline graphic ,

4.1.2.

Let

4.1.2.

Notice that in a special case of Inline graphic , i.e. Inline graphic , M is the companion matrix of the minimal polynomial of ϕ over Inline graphic . Then

4.1.2.

Note that for any Inline graphic ,

4.1.2.

and

4.1.2.

Notice also that for any Inline graphic and for any Inline graphic ,

4.1.2.
Lemma 4.1

Any eigenvalue of ϕ with multiplicity J becomes also the eigenvalue of M with the same multiplicity J. Furthermore the minimal polynomial of ϕ over Inline graphic is the same as the minimal polynomial of M over Inline graphic .

Proof

Let λ be an eigenvalue of ϕ with multiplicity J. Since Inline graphic and ϕ have the same eigenvalues, λ is an eigenvalue of Inline graphic . Let Inline graphic be the corresponding eigenvector of Inline graphic . Then

Proof

Since Inline graphic is nonzero, Inline graphic is nonzero and so λ is an eigenvalue of Inline graphic . Thus the eigenvalue λ of ϕ becomes also an eigenvalue of M. Since ϕ is a diagonal matrix, there are Inline graphic independent eigenvectors. The images of these vectors under Inline graphic are the eigenvectors of Inline graphic and linearly independent. Since all the eigenvalues of ϕ are algebraically conjugate with the same multiplicity J, all the eigenvalues of ϕ are also eigenvalues of Inline graphic with the same multiplicity J. Thus we note that the set of the eigenvalues of M consists of all the eigenvalues of ϕ and all the other algebraic conjugates of them which are not the eigenvalues of ϕ, and the multiplicity of all the eigenvalues of M is J.

Since ϕ is a diagonal matrix and all the eigenvalues of ϕ are algebraic integers, there exists a minimal polynomial of ϕ over Inline graphic . Since M is an integer matrix, there exists a minimal polynomial of M over Inline graphic as well. Let Inline graphic be the minimal polynomial of ϕ over Inline graphic so that Inline graphic where Inline graphic = Inline graphic , Inline graphic , and Inline graphic . Then using (30), for any Inline graphic ,

Proof

From (31), Inline graphic is a zero matrix. On the other hand, we can observe that if Inline graphic is the minimal polynomial of M over Inline graphic , then Inline graphic is a zero matrix as well. Thus the minimal polynomial of ϕ over Inline graphic is the same as the minimal polynomial of M over Inline graphic .

We can observe this property of Lemma 4.1 concretely with Example 5.10.

Let us consider the case that ϕ is non-unimodular, i.e. Inline graphic but Inline graphic . Let us denote Inline graphic by Inline graphic which is a lattice in Inline graphic . Then Inline graphic but Inline graphic . We define the M-adic space which is an inverse limit space of Inline graphic with Inline graphic . Note that Inline graphic is an injective homomorphism. Observe that Inline graphic is non-trivial and finite. We have an inverse limit of an inverse system of discrete finite groups,

4.1.2.

which is a profinite group. Note that Inline graphic can be supplied with the usual topology of a profinite group. Note that for any element Inline graphic = Inline graphic , Inline graphic ,

4.1.2.

Thus it becomes a compact group which is invariant under the action of M. In particular, the cosets Inline graphic , Inline graphic , Inline graphic form a basis of open sets in Inline graphic and each of these cosets is both open and closed. An important observation is that any two cosets in Inline graphic are either disjoint or one is contained in the other.

We let ρ denote the Haar measure on Inline graphic , normalized so that Inline graphic . Thus for a coset Inline graphic ,

4.1.2.

We define the translation-invariant metric d on Inline graphic via

4.1.2.

Note that Inline graphic contains a canonical copy of Inline graphic via the mapping

4.1.2.

We can observe that

4.1.2.

Note that Inline graphic . So we can conclude that the mapping Inline graphic embeds Inline graphic in Inline graphic . We identify Inline graphic with its image in Inline graphic . Note that Inline graphic is the closure of Inline graphic with respect to the topology induced by the metric d.

In the unimodularity case of ϕ, Inline graphic and so Inline graphic . Thus Inline graphic is trivial.

4.2. Concrete construction of a CPS

We construct a CPS taking Inline graphic as a physical space and Inline graphic as an internal space. We will consider this construction dividing ϕ into three cases as given in the following remark. The following construction of a CPS has already appeared in the work of Minervino & Thuswaldner (2014) in the case of Inline graphic . Here we construct a CPS for the case of Inline graphic .

Remark 4.2

For an expansion map ϕ, there are three cases.

(i) If ϕ is unimodular, there exists at least one algebraic conjugate λ other than the eigenvalues of ϕ for which Inline graphic . Then the map ι in (33) is a trivial map and the internal space is constructed mainly by the Euclidean space discussed in Section 4.1.1.

(ii) If ϕ is non-unimodular and there exists no other algebraic conjugate of the eigenvalues of ϕ whose absolute value is less than 1, then Inline graphic is a trivial group and the internal space is constructed exclusively by the profinite group (32) defined in Section 4.1.2.

(iii) If ϕ is non-unimodular and there exist algebraic conjugates (λ’s) other than the eigenvalues of ϕ for which Inline graphic , then the internal space is a product of the Euclidean space in Section 4.1.1 and the profinite group in Section 4.1.2.

Let us define

4.2.

where π is defined as in (24). Let us construct a CPS: 4.2.

where Inline graphic and Inline graphic are canonical projections,

4.2.

and

4.2.

It is easy to see that Inline graphic is injective. We shall show that Inline graphic is dense in Inline graphic and Inline graphic is a lattice in Inline graphic in Lemmas 4.3 and 4.4. We note that Inline graphic is injective, since Ψ is injective. Since ϕ commutes with the isomorphism σ in Theorem 2.9, we may identify the control point set Inline graphic with its isomorphic image. Thus from Theorem 2.9,

4.2.

where Inline graphic and Inline graphic . Note that for any Inline graphic and Inline graphic , Inline graphic by the definition of the tile-map. So we can note that

4.2.

Lemma 4.3

Inline graphic is a lattice in Inline graphic .

Proof

For the case (i) of Remark 4.2, Inline graphic is trivial. So the statement of the lemma follows from Lemma 3.2 of Lee, Akiyama & Lee (2020).

For the case (ii) of Remark 4.2, Inline graphic is trivial. Note that the matrix M in (26) is a Inline graphic integer matrix and L is a lattice in Inline graphic . So Inline graphic is a discrete subgroup of Inline graphic with respect to the product topology. Note that Inline graphic × Inline graphic , where Inline graphic is a compact set in Inline graphic . Since Inline graphic is compact, Inline graphic is relatively dense in Inline graphic . Thus the statement of the lemma follows.

For the case (iii) of Remark 4.2, let Inline graphic = Inline graphic . In Lemma 3.2 of Lee, Akiyama & Lee (2020), we notice that the unimodularity property is used only in observing that Inline graphic is not trivial in that paper. So by the same argument as Lemma 3.2 of Lee, Akiyama & Lee (2020), we obtain that Inline graphic is a lattice in Inline graphic . This means that Inline graphic is a discrete subgroup such that Inline graphic is compact. Notice that Inline graphic is still a discrete subgroup in Inline graphic . Furthermore, Inline graphic is compact. In fact, note that Inline graphic , where Inline graphic and Inline graphic are compact sets in Inline graphic and Inline graphic , respectively. Then

Proof

Since Inline graphic is compact, Inline graphic is relatively dense in Inline graphic × Inline graphic . Thus the statement of the lemma follows.

Lemma 4.4

Inline graphic and Inline graphic is dense in Inline graphic .

Proof

For the case (i) of Remark 4.2, Inline graphic is trivial. So the statement of the lemma follows from Lemma 3.2 of Lee, Akiyama & Lee (2020).

For the case (ii) of Remark 4.2, Inline graphic is trivial. Note that Inline graphic and Inline graphic is dense in Inline graphic . Thus Inline graphic is dense in Inline graphic .

Let us consider the case (iii) of Remark 4.2. It is known from Lee, Akiyama & Lee (2020) that Inline graphic is dense in Inline graphic . For any open neighbourhood Inline graphic in Inline graphic , there exists Inline graphic such that Inline graphic for some Inline graphic . Since Inline graphic is dense in Inline graphic and Inline graphic = Inline graphic , Inline graphic is dense in Inline graphic . Note that

Proof

So Inline graphic is dense in Inline graphic , where π is defined in (24). So

Proof

Hence

Proof

Thus Inline graphic is dense in Inline graphic .

Now that we have proved that (35) is a CPS, we would like to introduce a special projected set Inline graphic which will appear in the proof of the main result in Section 5. For Inline graphic and Inline graphic , we define

4.2.

where Inline graphic is an open ball around Inline graphic with a radius δ in Inline graphic and

4.2.

In the following lemma, we find an adequate window for a set Inline graphic and note that Inline graphic is a Meyer set.

Lemma 4.5

For any Inline graphic and Inline graphic , let Inline graphic = Inline graphic . Then for Inline graphic ,

Lemma 4.5

where Inline graphic and Inline graphic Inline graphic with Inline graphic . Furthermore Inline graphic forms a Meyer set.

Proof

Note that

Proof

The third equivalence comes from (34) and the fourth equivalence comes from (30). Thus

Proof

In the unimodularity case of ϕ, Inline graphic is trivial and Inline graphic . So the last equality (39) follows. In the non-unimodularity case of ϕ, Inline graphic implies Inline graphic . Since Inline graphic , Inline graphic . This shows the last equality (39). Hence for any Inline graphic ,

Proof

Since (35) is a CPS, Inline graphic is bounded, and Inline graphic is compact, Inline graphic has a non-empty interior and compact closure, Inline graphic is a model set for each Inline graphic and Inline graphic . It is given by Moody (1997) and Meyer (1972) that a model set is a Meyer set. Thus Inline graphic forms a Meyer set for each Inline graphic and Inline graphic .

5. Main result

Recall that we consider a primitive substitution tiling Inline graphic on Inline graphic with a diagonal expansion map ϕ whose eigenvalues are algebraically conjugate with the same multiplicity J and Inline graphic is rigid.

Under the assumption of the rigidity of Inline graphic , the pure discrete spectrum of Inline graphic implies that the set of eigenvalues of ϕ forms a Pisot family [Lemma 5.1 (Lee & Solomyak, 2012)]. Recall that

5.

where Inline graphic is a control point set of Inline graphic .

Lemma 5.1

Assume that ϕ satisfies the Pisot family condition. Then Inline graphic for some Inline graphic , where Inline graphic is given in (37).

Proof

Notice that the setting for Inline graphic fulfils the conditions to use Lemma 4.5 of Lee & Solomyak (2008). So from this lemma, for any Inline graphic ,

Proof

Recall that ϕ is an expansive map and satisfies the Pisot family condition. If there exists at least one algebraic conjugate λ other than the eigenvalues of ϕ for which Inline graphic , Inline graphic for some Inline graphic . So Inline graphic . If there exists no other algebraic conjugate of the eigenvalues of ϕ whose absolute value is less than 1, Inline graphic . From the definition of Inline graphic in (37), Inline graphic .

Lemma 5.2

Assume that Inline graphic has pure discrete spectrum. Then for any Inline graphic , there exists Inline graphic such that Inline graphic .

Proof

Note from (36) that for any Inline graphic and Inline graphic , Inline graphic is contained in Ξ. Recall that Inline graphic . From (10) and (36),

Proof

So for any Inline graphic , Inline graphic is a linear combination of Inline graphic Inline graphic over Inline graphic . Applying (11) many times if necessary, we get that for any Inline graphic , Inline graphic for some Inline graphic .

Proposition 5.3

Let Inline graphic be a primitive substitution tiling on Inline graphic with an expansion map ϕ. Under the assumption of the existence of the CPS (35), if Inline graphic has pure discrete spectrum, then for any given Inline graphic , there exists Inline graphic such that

Proposition 5.3

Proof

Note that Inline graphic is a Meyer set and Inline graphic for some Inline graphic . Since Ξ is relatively dense, for any Inline graphic , there exists Inline graphic such that Inline graphic . It is important to note that from the Meyer property of Inline graphic , the point set configurations

Proof

are finite up to translations. Let

Proof

Then Inline graphic and F is a finite set. Thus for any Inline graphic ,

Proof

From Lemma 5.2, for any Inline graphic , there exists Inline graphic such that Inline graphic . Since Inline graphic has pure discrete spectrum and so Inline graphic admits algebraic coincidence, by (11) there exists Inline graphic such that

Proof

Applying the inclusion (43) finitely many times, we obtain that there exists Inline graphic such that Inline graphic . Hence together with (42), there exists Inline graphic such that

Proof

Proposition 5.4

Let Inline graphic be a primitive substitution tiling on Inline graphic with a diagonalizable expansion map ϕ whose eigenvalues are algebraic conjugates with the same multiplicity and let Inline graphic be rigid. Let Φ be the corresponding κ-set substitution of Inline graphic (see Definition 2.3). Suppose that

Proposition 5.4

for some Inline graphic , Inline graphic and Inline graphic . Then each point set

Proposition 5.4

is a model set in the CPS (35) with a window Inline graphic in Inline graphic which is open and precompact.

Proof

For each Inline graphic and Inline graphic , there exist Inline graphic and Inline graphic for which

Proof

From Inline graphic ,

Proof

By Theorem 2.7 and Proposition 5.3, there exists Inline graphic such that Inline graphic . Thus

Proof

where Inline graphic and Inline graphic depends on Inline graphic . Let

Proof

where Inline graphic . Then for any Inline graphic

Proof

In (47), we assume that we have taken the minimal number Inline graphic so that Inline graphic defined by using Inline graphic does not satisfy (48).

From Lemma 5.1, Inline graphic for some Inline graphic . Thus Inline graphic . Since Inline graphic is compact, Inline graphic is compact. Thus Inline graphic is compact.

Recall from Lagarias & Wang (2003) and Lee et al. (2003) that there exists a finite generating set Inline graphic such that

5.

Since Inline graphic is dense in Inline graphic by Lemma 4.4, we have a unique extension of Φ to a κ-set substitution on Inline graphic in the following way; if Inline graphic for which

5.

we define

5.

where Inline graphic , D and M are given in (23) and (26), and Inline graphic . If there is no confusion, we will use the same notation Inline graphic for the extended map.

Note that, by the Pisot family condition on ϕ, if there exists at least one algebraic conjugate λ other than the eigenvalues of ϕ for which Inline graphic , there exists some Inline graphic such that Inline graphic for any Inline graphic . Furthermore, from (33)

5.

By the same argument as in Section 3 of Lee & Moody (2001), the κ-set substitution Φ induces a multi-component iterated function system on Inline graphic . Thus the κ-set substitution Φ determines a multi-component iterated function system Inline graphic on Inline graphic and Inline graphic is a contraction on Inline graphic . Let Inline graphic be a substitution matrix corresponding to Inline graphic . Defining the compact subsets

5.

and using (5) and the continuity of the mappings, we have

5.

This shows that Inline graphic are the unique attractor of Inline graphic .

Lemma 5.5

Let

Lemma 5.5

where Inline graphic , as obtained in (47) with the minimal number Inline graphic satisfying (48). For any Inline graphic and any Inline graphic , we have

Lemma 5.5

Proof

For any Inline graphic , Inline graphic . Recall that

Proof

So for any Inline graphic , Inline graphic . Thus for any Inline graphic ,

Proof

Notice that Inline graphic , where Inline graphic and Inline graphic . Since we have taken the minimal number Inline graphic in (47) for each Inline graphic , Inline graphic . Thus

Proof

The following proposition shows that the Haar measure of Inline graphic is zero for each Inline graphic . This is proved using Keesling’s argument (Keesling, 1999).

Proposition 5.6

Let Inline graphic be a primitive substitution tiling on Inline graphic with a diagonalizable expansion map ϕ whose eigenvalues are algebraic conjugates with the same multiplicity and let Inline graphic be rigid. Let Φ be the corresponding κ-set substitution of Inline graphic (see Definition 2.3). If

Proposition 5.6

where Inline graphic , Inline graphic and Inline graphic , then each model set Inline graphic , Inline graphic , has a window with boundary measure zero in the internal space Inline graphic of CPS (35).

Proof

Let us define Inline graphic , where Inline graphic is the maximal open set in Inline graphic satisfying (46). From the assumption of (52), we first note that ϕ fulfils the Pisot family condition from Theorem 2.7 and Lemma 5.1 of Lee & Solomyak (2012). For every measurable set Inline graphic and for any Inline graphic with Inline graphic ,

Proof

where μ is a Haar meaure in Inline graphic , ρ is a Haar measure in Inline graphic , Inline graphic . Note that Inline graphic . In particular,

Proof

where

Proof

Let us denote Inline graphic for Inline graphic and Inline graphic = Inline graphic . Then for any Inline graphic ,

Proof

From Proposition 5.3, we know that Inline graphic for any Inline graphic . Thus

Proof

Note that the Perron–Frobenius eigenvalue of Inline graphic is Inline graphic from Lagarias & Wang (2003). Since the minimal polynomials of ϕ and M over Inline graphic are the same from (27) and the multiplicities of eigenvalues of ϕ and M are the same from Lemma 4.1, we have

Proof

Since Inline graphic is a non-negative primitive matrix with Perron–Frobenius eigenvalue Inline graphic , from Lemma 1 of Lee & Moody (2001)

Proof

By the positivity of Inline graphic and Inline graphic , Inline graphic = Inline graphic .

Recall that for any Inline graphic ,

Proof

From (3), for any Inline graphic ,

Proof

and

Proof

Note that Inline graphic and Inline graphic is a non-empty open set. As Inline graphic , Inline graphic is dense in Inline graphic . We can find a non-empty open set Inline graphic such that Inline graphic . So there exists Inline graphic such that Inline graphic and

Proof

Since Inline graphic ,

Proof

Thus there exists Inline graphic such that

Proof

Hence

Proof
Proof

The inclusion (55) follows from Lemma 5.5. Let

Proof

Then

Proof

Thus from (54), there exists a matrix Inline graphic for which

Proof

where Inline graphic and Inline graphic . If Inline graphic , again from Lemma 1 of Lee & Moody (2001), Inline graphic . This is a contradiction to (54). Therefore Inline graphic for any Inline graphic .

The regularity property of model sets is shared for all the elements in Inline graphic (see Schlottmann, 1998; Baake et al., 2007; Lee & Moody, 2006). We state it in the following proposition.

Proposition 5.7

[(Schlottmann, 1998), Proposition 7 (Baake et al., 2007), Proposition 4.4 (Lee & Moody, 2006).] Let Inline graphic be a Delone κ-set in Inline graphic for which Inline graphic where Inline graphic is compact and Inline graphic for Inline graphic with respect to to some CPS. Then for any Inline graphic , there exists Inline graphic so that

Proposition 5.7

From the assumption of pure discrete spectrum and Remark 5.5 of Lee, Akiyama & Lee (2020), we can observe that the condition (52) is fulfilled in the following theorem.

Theorem 5.8

Let Inline graphic be a repetitive primitive substitution tiling on Inline graphic with a diagonalizable expansion map ϕ whose eigenvalues are algebraic conjugates with the same multiplicity and let Inline graphic be rigid. If Inline graphic has pure discrete spectrum, then each control point set Inline graphic , Inline graphic , is a regular model set in CPS (35) with an internal space which is a product of a Euclidean space and a profinite group.

Proof

Through Section 4.1, we can construct the CPS (35) whose internal space is a product of a Euclidean space and a profinite group. Since Inline graphic has pure discrete spectrum and is repetitive, we can find a substitution tiling Inline graphic in Inline graphic such that

Proof

where Inline graphic , Inline graphic and Inline graphic . From Propositions 5.3, 5.6 and 5.7, the statement of the theorem follows.

Corollary 5.9

Let Inline graphic be a repetitive primitive substitution tiling on Inline graphic with a diagonalizable expansion map ϕ whose eigenvalues are algebraic conjugates with the same multiplicity and Inline graphic be rigid. Then Inline graphic has pure discrete spectrum if and only if each control point set Inline graphic , Inline graphic , is a regular model set in CPS (35) with an internal space which is a product of a Euclidean space and a profinite group.

Proof

It is known that regular model sets have pure discrete spectrum in quite a general setting (Schlottmann, 2000). Together with Theorem 5.8, we obtain the equivalence between pure discrete spectrum and a regular model set in substitution tilings.

Now let us look at an example given by Baake et al. (1998).

Example 5.10. We look at the example of non-unimodular substitution tiling which is studied by Baake et al. (1998). This example is proven to be a regular model set in the setting of a CPS constructed by Baake et al. (1998). This has also been considered by Lee, Akiyama & Lee (2020), but it could only be described as a model set, not a regular model set. Here in the setting of CPS (35), we show that this example gives a regular model set. The substitution matrix of the primitive two-letter substitution

5.

has the Perron–Frobenius eigenvalue Inline graphic which is a Pisot number. A geometric substitution tiling arising from this substitution can be obtained by replacing symbols a and b in this sequence by the intervals of length Inline graphic and Inline graphic . Then we have the following tile-substitution ω

5.
5.

where Inline graphic and Inline graphic . Since Inline graphic = 0 is the minimal polynomial of λ over Inline graphic and the constant term of the polynomial is 2, the expansion factor λ is non-unimodular. Then we can construct a repetitive substitution tiling Inline graphic using the substitution ω.

From Theorem 2.9, we know that the control point set Inline graphic fulfils

5.

Let Inline graphic and Inline graphic as in Section 4.1.2. Since

5.
5.

we get

5.

Recall from (32)

5.

Let

5.

where Inline graphic , Inline graphic , and Inline graphic is a M-adic space. Since this substitution tiling is known to have pure discrete spectrum (see Baake et al., 1998), it admits an algebraic coincidence. By Proposition 4.4 of Lee (2007) and rewriting the substitution, if necessary, we know that there exists a substitution tiling Inline graphic such that Inline graphic and

5.

Then, by the same argument as in Proposition 5.4,

5.

where Inline graphic depends on z and

5.

for some ball Inline graphic of radius Inline graphic around 0 in Inline graphic . Let

5.

Thus

5.

From Proposition 5.7, we can observe that the pure discrete spectrum of Inline graphic gives a model set with an open and precompact window in the internal space Inline graphic for the control point set Inline graphic . From Proposition 5.6, the measures of the boundaries of the windows are all zero.

Now let us look at another example of a constant-length substitution tiling in Inline graphic . This example shows that it is important to start with a control point set satisfying the containment (10).

Example 5.11. Consider a two-letter substitution defined as follows:

5.

The expansion factor 3 and each prototile can be taken as a unit interval. Starting from Inline graphic , we can expand b to the left-hand side and a to the right-hand side, applying the substitution infinite times. Then we get the following bi-infinite sequence:

5.

We consider two prototiles Inline graphic and Inline graphic each of which corresponds to the letter a and the letter b. Following the sequence (59), we replace each letter by the corresponding prototile and obtain a substitution tiling Inline graphic which is fixed under the substitution 5.

As a representative point of each tile, if one takes the left end of each interval in the tiling, one gets two point sets Inline graphic and Inline graphic such that Inline graphic and Inline graphic . Since Inline graphic , we can take Inline graphic . Notice in this case that the Euclidean part for the internal space is trivial and the profinite group is

5.

Notice that there does not exist Inline graphic such that

5.

This means that neither Inline graphic nor Inline graphic can be described as a model set projected from a window whose interior is non-empty in Inline graphic . However the substitution tiling Inline graphic has pure discrete spectrum, since it is a periodic structure. The problem here is that the control point set Inline graphic is not taken to satisfy the containment (10).

On the other hand, if we take the tile map Inline graphic for which

5.

where Inline graphic and Inline graphic with Inline graphic and Inline graphic , then the control point set Inline graphic is Inline graphic and Inline graphic . So

5.

satisfying the containment (10), and the profinite group is

5.

So

5.

Therefore Inline graphic can be described as a model set.

6. Further study

In this paper, the rigid structure property of substitution tilings is used to make a connection from pure discrete spectrum to regular model sets, especially to compute the boundary measure of windows. So far, the rigid structure property is known for substitution tilings whose expansion maps (Q) are diagonalizable and the eigenvalues of Q are algebraically conjugate with the same multiplicity (Lee & Solomyak, 2012). Thus it would be useful to know some rigid structure for more general settings. If the rigidity property is precisely known for general substitution tilings, it is expected that we will be able to find the connection from pure discrete spectrum to regular model sets.

Acknowledgments

The author is sincerely grateful to the referees for their very sharp comments which helped to improve the paper. She would like to thank U. Grimm, M. Baake, F. Gähler and N. Strungaru for their important discussions at MATRIX in Melbourne where this research was initiated. She is also grateful to S. Akiyama for helpful discussions. She is indebted to R. V. Moody for his interest and valuable comments on this work.

Funding Statement

Funding for this research was provided by: National Research Foundation of Korea (grant No. 2019R1I1A3A01060365).

References

  1. Akiyama, S., Barge, M., Berthé, V., Lee, J. Y. & Siegel, A. (2015). Mathematics of Aperiodic Order, pp. 33–72, edited by J. Kellendonk, D. Lenz & J. Savinien. Progress in Mathematics, Vol. 309. Basel: Birkhäuser.
  2. Baake, M. & Grimm, U. (2013). Aperiodic Order, Vol. 1. Cambridge University Press.
  3. Baake, M., Lenz, D. & Moody, R. V. (2007). Ergod. Th. Dyn. Sys. 27, 341–382.
  4. Baake, M. & Moody, R. V. (2004). J. Reine Angew. Math. 573, 61–94.
  5. Baake, M., Moody, R. V. & Schlottmann, M. (1998). J. Phys. A Math. Gen. 31, 5755–5765.
  6. Baker, V., Barge, M. & Kwapisz, J. (2006). Ann. Inst. Fourier, 56, 2213–2248.
  7. Ei, H., Ito, S. & Rao, H. (2006). Ann. Inst. Fourier, 56, 2285–2313.
  8. Frank, N. P. & Robinson, E. A. Jr (2006). Trans. Am. Math. Soc. 360, 1163–1178.
  9. Keesling, J. (1999). Topol. Appl. 94, 195–205.
  10. Kenyon, R. & Solomyak, B. (2010). Discrete Comput. Geom. 43, 577–593.
  11. Kwapisz, J. (2016). Invent. Math. 205, 173–220.
  12. Lagarias, J. C. (1996). Commun. Math. Phys. 179, 365–376.
  13. Lagarias, J. C. & Wang, W. (2003). Discrete Comput. Geom. 29, 175–209.
  14. Lee, D.-I., Akiyama, S. & Lee, J.-Y. (2020). Acta Cryst. A76, 600–610. [DOI] [PMC free article] [PubMed]
  15. Lee, J.-Y. (2007). J. Geom. Phys. 57, 2263–2285.
  16. Lee, J.-Y., Akiyama, S. & Nagai, Y. (2018). Symmetry, 10, 511.
  17. Lee, J.-Y., Lenz, D., Richard, C., Sing, B. & Strungaru, N. (2020). Lett. Math. Phys. 110, 3435–3472.
  18. Lee, J.-Y. & Moody, R. V. (2001). Discrete Comput. Geom. 25, 173–201.
  19. Lee, J.-Y. & Moody, R. V. (2006). Ann. Henri Poincaré, 7, 125–143.
  20. Lee, J.-Y., Moody, R. V. & Solomyak, B. (2003). Discrete Comput. Geom. 29, 525–560.
  21. Lee, J.-Y. & Solomyak, B. (2008). Discrete Comput. Geom. 39, 319–338.
  22. Lee, J.-Y. & Solomyak, B. (2012). Discrete Contin. Dyn. Syst. 32, 935–959.
  23. Lee, J.-Y. & Solomyak, B. (2019). Discrete Contin. Dyn. Syst. 39, 3149–3177.
  24. Mauduit, C. (1989). Invent. Math. 95, 133–147.
  25. Meyer, Y. (1972). Algebraic Numbers and Harmonic Analysis. Amsterdam: North Holland.
  26. Minervino, M. & Thuswaldner, J. (2014). Ann. Inst. Fourier, 64, 1373–1417.
  27. Moody, R. V. (1997). NATO Adv. Sci. Inst. Ser. C. Math. Phys. Sci. 489, 403–441.
  28. Praggastis, B. (1999). Trans. Am. Math. Soc. 351, 3315–3349.
  29. Radin, C. & Wolff, M. (1992). Geom. Dedicata, 42, 355–360.
  30. Schlottmann, M. (1998). Fields Institute Monographs, Vol. 10, pp. 247–264. Providence, RI: AMS.
  31. Schlottmann, M. (2000). CRM Monograph Series, Vol. 13, pp. 143–159. Providence, RI: AMS.
  32. Siegel, A. (2002). Lecture Notes in Mathematics, Vol. 1794, pp. 199–252. Berlin, Heidelberg: Springer.
  33. Solomyak, B. (1997). Ergod. Th. Dyn. Sys. 17, 695–738.
  34. Strungaru, N. (2017). Aperiodic Order, edited by M. Baake & U. Grimm, pp. 271–342. Encyclopedia of Mathematics and its Applications. Cambridge University Press.
  35. Thurston, W. P. (1989). Groups, Tilings and Finite State Automata. Summer 1989 AMS Colloquium Lectures. Research Report GCG 1. http://timo.jolivet.free.fr/docs/ThurstonLectNotes.pdf.

Articles from Acta Crystallographica. Section A, Foundations and Advances are provided here courtesy of International Union of Crystallography

RESOURCES