When Periodicities Enforce Aperiodicity^{†}^{†}thanks: This work was supported by the ANR project QuasiCool (ANR12JS0201101)
Abstract
Nonperiodic tilings and local rules are commonly used to model the long range aperiodic order of quasicrystals and the finiterange energetic interactions that stabilize them. This paper focuses on planar rhombus tilings, that are tilings of the Euclidean plane which can be seen as an approximation of a real plane embedded in a higher dimensional space. Our main result is a characterization of the existence of local rules for such tilings when the embedding space is fourdimensional. The proof is an interplay of algebra and geometry that makes use of the rational dependencies between the coordinates of the embedded plane. We also apply this result to some cases in a higher dimensional embedding space, notably tilings with fold rotational symmetry.
1 Introduction
A tiling is a covering of some space by nonoverlapping compact sets called tiles.
Local rules are constraints on the way neighbour tiles of a tiling can fit together.
Jigsaw puzzles provide a graphic example, with the dents and bumps as local rules.
Tilings and local rules only relatively recently went beyond recreational mathematics.
The first major step occured in the early 60’s, when the logician Hao Wang asked in [30] if there exists an algorithm which decides whether any given finite set of tiles can tile the whole plane (each tile can be used several times).
His student Robert Berger gave a negative answer in [4], with a key ingredient of his proof being the firstever tile set which can tile the plane but only in a nonperiodic way (that is, no tiling is invariant by a nontrivial translation).
Such tile sets are said to be aperiodic.
Some other examples were since then discovered, with the most celebrated one probably being the Penrose tiles [26].
The second major step occured twenty years later, with the groundbreaking discovery by Dan Shechtman of quasicrystals, that are nonperiodic but nevertheless ordered materials [28].
The link with (ordered) nonperiodic tilings was indeed quickly done, with local rules modeling the energetic finiterange interactions between atoms [24].
A primordial issue in mathematical physics then became to determine which type of quasicrystalline structure can exist.
In this paper, we focus on the case of the rhombus tilings of the plane.
Such tilings can indeed profitably be seen as digitizations of surfaces in higher dimensional spaces.
Among them are the plane digitizations obtained by the socalled canonical cut and projection method (see [5, 9]).
They are said to be planar and aim to model the longrange order of quasicrystals.
This connects the algebraic parameters of a plane with the geometry of its digitization, and one of main issues is: which planes have a digitization characterized by local rules?
Note that rhombus tilings are surely far from comprising all the existing tilings, but they nevertheless provide a large family which can notably model all the quasicrystalline symmetries yet experimentally observed, with the exception of the icosahedral one (which requires rhombohedra tilings of the threedimensional space; we actually checked that our method extends to this specific case).
We also focus on a special kind of local rules, namely uncolored weak ones.
Formally, local rules can be expressed as a finite set of finite patterns that must be avoided (forbidden patterns).
They are colored when the same tile can appear in different colors in the forbidden patterns, thus playing different roles.
Colored local rules are more powerful but also less realistic from the physical viewpoint (the model is even more complicated).
This could explain why uncolored ones have retained the attention of many authors.
Weak local rules have been introduced for planar rhombus tilings by Leonid Levitov in [25], as opposed to strong local rules.
Whereas strong local rules enforce a tiling to be a specific digitization of a plane, weak ones only require the digitization to stay at bounded distance from a plane.
In other words, weak local rules allow shortrange disorder (some authors speak about bounded perpspace fluctuations).
So, which planar rhombus tilings do admit weak uncolored local rules?
This has been an issue of much debate in mathematical physics during the early 90’s (see, e.g., [6, 25, 18, 19, 20, 21, 22, 23, 29]).
Several conditions have been found, usually stated in terms of algebraic properties of the digitized plane, but no complete characterization has yet emerged.
At a minimum, examples of nonperiodic tilings do exist (e.g., the Penrose tilings).
At the other extreme, Thang Le has proved in [22] that digitized plane admitting weak uncolored local rules are always generated by vectors whose entries are algebraic numbers.
Let us mention, in comparison, that a plane digitization is proven in [7] to admit weak colored local rules if and only if the plane can be generated by computable vectors (that is, their entries can be computed to within any desired precision by a finite, terminating algorithm).
Our results are along those lines.
We rely on the notion of subperiod, which is related to the SIcondition introduced by Leonid Levitov in [25].
The idea is that the vectors which generate an irrational plane can nevertheless have rational depencies between their entries.
The subperiods catch such kind of dependencies, which turn out to easily translate into equations on the Grassmann coordinates of the plane, yielding a system of polynomial equations.
The point is that the subperiods can be enforced by specific local rules.
Our main result, roughly stated, is that the existence of such specific local rules is equivalent to the zerodimensionality of the corresponding system of polynomial equations (at least when the digitized plane lives in , Corollary 1).
Actually, a fruitful approach turned out to isolate the subquestion of planarity: when do the local rules associated with the subperiods of a plane allow only rhombus tilings which are digitizations of (any) planes?
Theorem 1 gives an answer when, again, the plane lives in .
This is further used in higher dimensional cases (Proposition 8 and Corollary 2).
The general goal of reducing the existence of local rules to the resolution of a system of equations remains to be achieved.
The paper is organized as follows. Section 2 gives formal definitions of the above mentioned notions (planar rhombus tilings, local rules, subperiods…). In Section 3, we consider plane digitization in , we state and prove the main result (Theorem 1), as well as provide illustrative examples. We show in Section 4 how this result can, under some conditions, be extended to higher dimensional spaces. In particular, we apply our method to socalled fold tilings, which play a prominent role in modelling quasicrystals. We show that there are local rules when is an odd multiple of or (Corollary 2). Although it has been already proven by Joshua Socolar [29] that local rules exist for any odd , our proof is more algebraic and does not rely on the specific geometry of fold tilings. Moreover, we also get some new cases if we in addition allow a minimization principle (Proposition 9).
2 Settings
2.1 Planar rhombus tilings
Let be pairwise noncollinear unitar vectors of the Euclidean plane. They define the rhombus prototiles
A tile is a translated prototile (tile rotation or reflection are forbidden).
A rhombus tiling is a covering of the Euclidean plane by interiordisjoint tiles satisfying the edgetoedge condition: whenever the intersection of two tiles is not empty, it is either a vertex or an entire edge.
It is said to be nondegenerated if each tile appears at least one time.
A pattern is a finite (usually connected) union of tiles which appears in some tiling.
Let be the canonical basis of .
Following Levitov [25], a rhombus tiling is lifted in as follows: an arbitrary vertex is first mapped onto the origin , then each tile is mapped onto the dimensional face of a unit hypercube of generated by and , with two tiles adjacent along an edge being mapped onto two faces adjacent along an edge .
This lifts the boundary of a tile – and by induction the boundary of any patch of tiles – onto a closed curve of and hence ensures that the image of a tiling vertex do not depends on the path followed to get from the origin to this vertex.
The lift of a tilings is thus a “stepped” surface of codimension in (unique up to the choice of the initial vertex).
By extension, such a rhombus tiling is said to have codimension .
The lift is the graph of a function from to which is Lipschitz continuous, with a Lipschitz constant that can be chosen to depend only on the ’s.
Indeed, the limit in how fast this function can change between two points in a tile depends only on the way this tile is lifted in , and this then extends to any two points of the tiling.
Given the tiles, the set of lifts of all the possible tilings of the plane are thus uniformly Lipschitz continuous.
A rhombus tiling is said to be planar if there is and an affine plane such that the tiling can be lifted into the tube (we need to have tiles into the tube).
The smallest suitable is called the thickness of the tiling, and the corresponding is called the slope of the tiling.
Both are uniquely defined.
Following Levitov [25], one speaks about strong or weak planarity depending on whether or .
A planar rhombus tiling is thus an approximation of its slope: the less the thickness, the better the approximation.
Figure 1 illustrates this in the codimension one case.
Examples in higher codimensions shall be further provided.
Strongly planar rhombus tilings are also referred to as canonical cut and project tilings. They are uniformly recurrent, that is, whenever a pattern occurs once, there exists such that this pattern reoccurs at distance at most from any point of the tiling. Weakly planar rhombus tilings are not necessarily uniformly recurrent. Nevertheless, in any planar rhombus tiling, the ratio of a given prototile among the prototiles occuring at distance at most from a point of the tiling admits a limit when goes to infinity, called its frequency, which depends only on the slope (see Prop. 4).
2.2 Local rules
Draw a disk of diameter on a tiling and consider the pattern formed by all the tiles which intersect this disk: this is called a map of the tiling. The atlas of a tiling is the set of all its maps. We use this to define the weak uncolored local rules mentioned in the introduction, that we shall simply refer to as local rules since they are the only type further considered:
Definition 1
A strongly planar rhombus tiling of slope is said to admit local rules of diameter and thickness if, whenever its atlas contains the atlas of another rhombus tiling, this latter is planar with slope and thickness at most . By extension, the slope itself is said to admit local rules.
When a tiling admits local rules of diameter , the patterns of the atlas are themselves called local rules.
Since atlas of rhombus tilings are finite, it is equivalent and sometimes more convenient to define local rules by giving a set of patterns which are not allowed to occur in these local rules.
These patterns are said to be forbidden.
As for planar rhombus tilings, one speaks about strong or weak local rules depending on whether or . This paper aims to characterize the slopes which admit local rules. Before focusing on totally irrational slopes, let us first dispose of the matter on slopes which contain rational directions. Consider, first, the case of a rational slope:
Proposition 1
A slope with two rational directions admits strong local rules.
Proof.
To each rational direction of a slope corresponds a period of the corresponding strongly planar tilings, that is, a translation vector which leaves them invariant.
If there are two (independent) such directions, then the tilings have a bounded fundamental domain and it suffices to consider local rules whose diameter is greater than the one of this fundamental domain.
Consider, now, the case of a slope which is neither rational nor irrational:
Proposition 2
A slope with exactly one rational direction admits no local rules.
Proof.
Let be a strongly planar tiling with exactly one rational direction.
Let be given.
Consider a period of and consider the pattern formed by the tiles at distance less than from the segment .
Since is uniformly recurrent, there exists such that a translation by maps onto one of its reoccurrences.
This yields two periodic parallel and equal “sticks” respectively formed by the tiles at distance less than from and .
Consider now the patterns formed by the tiles at distance less than of the segment joining and , for .
Since there is a finite number of different patterns of a given size, there are and such that .
Consider now the tiling with fundamental domain the parallelogram with vertices , , and .
It has two rational directions and thus cannot have the slope of .
However, by construction, any map of is also a map of .
This shows that does not admit local rules of any diameter .
The case on which we shall focus is thus the one of irrational slopes.
2.3 Subperiods
Let us introduce this central notion:
Definition 2
The shadow of a rhombus tiling is the orthogonal projection of its lift onto the space generated by , and . An subperiod of a rhombus tiling is a prime period of its shadow, hence an integer vector. A lift of such a subperiod is any vector of which projects on it in the shadow.
A rhombus tiling has thus shadows, which are codimension one surfaces in .
By extension, we call subperiods of a slope the subperiods of the strongly planar rhombus tiling with this slope.
Figure 2 illustrates the notion of subperiod, while Figure 3 illustrates the following proposition.
Proposition 3
The subperiods of a slope can be enforced by local rules.
Proof.
Let be a subperiod of a slope and the orthogonal projection on basis vectors such that .
The union of the atlases of strongly planar rhombus tilings of slope enforce their periodicity as soon as .
Then, the uniform recurrence of the strongly planar rhombus tilings of slope ensures that there is such that the image under of the union of their atlases contains all the patterns of .
Now, if a rhombus tiling has a atlas included in , then its image under has a atlas included in and thus admits as a period.
Hence, by definition, the initial tiling admits as a subperiod (enforced by local rules of diameter ).
2.4 Grassmann coordinates
Let us recall the notion of Grassmann coordinates in our particular case (for a general presentation, see, e.g., [13], Chap. 7). The Grassmann coordinates of a plane generated by and are the real numbers
for . We write , with the Grassmann coordinates being ordered by lexicographic order on their indices. Grassmann coordinates are defined up to a common multiplicative factor and turn out to not depend on the choice of the generating vectors. They are moreover characterized: a nonzero tuple of reals are the Grassmann coordinates of some plane if and only if they satisfy the following quadratic equations, called Plücker relations:
for . By extension, we call Grassmann coordinates of a planar rhombus tiling the Grassmann coordinates of its slope; they can actually be “read” on the tiles:
Proposition 4
The frequency of in a planar rhombus tiling is .
In particular, if has a zero Grassmann coordinate then the tile does not appears in planar tilings of slope , that is, those are degenerated tilings (we shall avoid this case further). Note also that the sign of a Grassmann coordinate of a planar tiling depends only on the ’s (a slope with a different sign would yield a tiling which do not project correctly onto a tiling of the plane). The proof of the above proposition, further not used, is left to the reader. We will rather rely on the following:
Proposition 5
If a planar rhombus tiling has an subperiod , then
Proof.
Consider the shadow of a planar rhombus tiling.
It is a planar rhombus tiling in whose slope is generated by and , hence has normal vector .
This vector thus has zero dot product with any vector in the slope, in particular with : this yields the claimed relation.
To each subperiod thus corresponds a linear relation with integer coefficients on Grassmann coordinates. Together with the Plücker relations, this yields a system of polynomial equations. If this system has a unique solution, then subperiods – hence local rules by Prop. 3 – can enforce planar rhombus tiling to have this solution as slope. Actually, this remains true if there are finitely many solutions, i.e., if the system of polynomial equations is zerodimensional, because one can always increase the diameter of local rules to select one among finitely many slopes. One can then use very efficient algorithms (usually relying on Gröbner bases) to determine whether this system is zerodimensional. However, in order to conclude that such a slope has local rules, it must be proven that local rules can also enforce the planarity itself: this becomes the key issue.
3 Codimension two
3.1 Statement of the main result
Subperiods are said to enforce planarity when the rhombus tilings with all these subperiods are planar with a uniformly bounded thickness.
Let us stress that there is no restriction on the number of slopes: it can be infinite.
The planarity is said to be irrational if there is at least one planar rhombus tilings with an irrational nondegenerated slope which has these subperiods (otherwise, we refer to Prop. 1 and 2).
We here focus on codimension two rhombus tilings, as the most simple nontrivial case. Codimension one tilings are indeed trivial: any subperiod is a period, whence the only slopes that can be enforced by subperiods are rational ones (according to Prop. 1). Higher codimension tilings shall be considered in the next section. The main result we get is the following:
Theorem 1
The subperiods of a codimension two rhombus tiling enforce irrational planarity if and only if three of them, each in a shadow with only one period, can be lifted in an irrational nondegenerated plane onto pairwise noncollinear vectors. This holds when subperiods characterize finitely many slopes.
Corollary 1
If a codimension two planar rhombus tiling has subperiods which characterize finitely many slopes, then it admits local rules.
This sufficient condition can be algorithmically checked on a given slope : it suffices to find its subperiods and to check that the associated equations, togerther with the Plücker relations, yield a zerodimensional system. One can even bound the diameter of the local rules by the length of the largest lift in of the subperiods. Sharp bounds on this thickness however remain to be found. In particular, when is it equal to one? The proof of this theorem is postponed to the section 3.4 and we shall first illustrate it on some examples.
3.2 First example: AmmannBeenker tilings
Independently introduced by Ammann in the 1970s and Beenker in 1982 ([11, 3]), the AmmannBeenker tilings are the strongly planar rhombus tilings of codimension two whose slope is generated by the two vectors and , . The Grassmann coordinates of this slope are . There are four subperiods:

the subperiod which corresponds to ;

the subperiod which corresponds to ;

the subperiod which corresponds to ;

the subperiod which corresponds to .
Plugging this into the only one Plücker relation with the normalization yields . The system has thus dimension one and characterizes the family of planes
In particular, the slope of the AmmannBeenker tilings is obtained for . The subperiods lift in onto the pairwise noncollinear vectors
Theorem 1 ensures that the rhombus tilings with these subperiods are planar.
Note that local rules can only enforce such subperiods for ranging in a closed interval (because the subperiods become arbitrarily large for large ), but one can color the local rules to enforce the whole family, see [2, 16]. Note also that it would suffice to enforce (that is, according to Prop. 4, to enforce the square tiles and to appear with the same frequency) in order to characterize the slope of the AmmannBeenker tilings. This however cannot be done by local rules, as first pointed out by Burkov in [6]: we need to use colored local rules, as first done by Ammann [11, 1]. As an alternative, we can also obtain AmmannBeenker tilings as the solution of an optimization problem. Indeed, according to Prop. 4, the quantity is proportional to the frequency of the square tiles in and is minimal for .
3.3 Second example: a golden octagonal tiling
Let us now consider an example where subperiods characterize finitely many slopes. Let be the golden ratio and the plane generated by
Its Grassmann coordinates are . There are four subperiods:

the subperiod which corresponds to ;

the subperiod which corresponds to ;

the subperiod which corresponds to ;

the subperiod which corresponds to .
Plugging this into the Plücker relation with the normalization yields , where . Subperiods thus characterize and its algebraic conjugate^{3}^{3}3Only one really yields a tiling because their Grassmann coordinates have different sign., and Corollary 1 ensures that there are local rules. One can check that the subperiods indeed lift in onto the pairwise noncollinear vectors
These lifts have length at most : this bounds the diameter of local rules.
3.4 Proof of the main result
The proof of Theorem 1 is organized in three lemmas. The first lemma gives a condition on subperiods to ensure planarity:
Lemma 1
If a rhombus tiling of codimension two has three subperiods, each in a shadow with only one period, which can be lifted in an irrational nondegenerated plane onto pairwise noncollinear vectors, then it is planar.
Proof.
Let be a codim. two tiling satisfying the condition of the Lemma.
Let , and denote the subperiods, each in a shadow with only one subperiod.
For , let denotes the lift of in .
Space parametrization.
The polynomial system defined by the Plücker relation and the linear relations associated with the subperiods of has at least two irrational solutions.
Indeed, if there are only finitely many solutions, then they are algebraic and each irrational one (e.g, ) yields by algebraic conjugation a different irrational solution.
Otherwise, that is, if there are infinitely many solutions, then they form a continuous curve in the set of planes of .
Since the set of planes which contain a rational line has measure zero (it is a countable union of dimension three subspaces of ), this curve contains infinitely many irrational planes.
Let thus be an irrational solution other than .
We shall prove by contradiction that .
For , let be the plane generated by and .
This defines three different rational planes.
Assume that contains a line, necessarily irrational.
Hence .
This lines belongs to at most one of the ’s, say , because if two rational planes intersect along a line, then it is a rational line.
And since and intersects and by lines which generate it, one has .
We shall get the wanted contradiction by proving that .
With and , one computes
It is known (see, e.g., [13], p. 304) that if the intersection of two planes of with Grassmann coordinates and is not , then
In our case, would yield .
But this is impossible because , generated by and , is nondegenerated and has the Grassmann coordinate .
Hence , that is, .
Lift parametrization.
For , let denotes the lift of in .
Let denotes the projection parallel to onto .
Up to a permutation of the vectors of the standard basis of , one can assume that the angle between and has the same sign as the angle between and (the vectors defining the tile ).
This way, if we let be a lift of , then is a homeomorphism from onto .
On , is indeed nothing but the tiling (up to a stretching of the edges of its tiles since and can be different – they are however never parallel because of the irrationality of ).
There are thus two continuous functions and defined on such that is the image of under
We shall now show that stays at bounded distance from a plane.
From subperiods to bounded fluctuations.
Let denote the projection onto the shadow which contains .
For any , since the projection parallel to is a homeomorphism from onto , the plane intersects the shadow along a curve (see Fig. 7).
One has
Since both and are periodic, so is . In particular, it stays at bounded distance from the line . Moreover, the bound can be chosen independently of because is Lipschitz. For , since , this ensures that is uniformly bounded. In other words, has bounded fluctuations in the direction . Similarly, for , yields that has bounded fluctuations in the direction . For , note that, up to a rescaling, one has for some real . This allows to write
Then, with , the periodicity of yields that has bounded fluctuations in the direction .
From bounded fluctuations to functional equations.
Since and form a basis of , let stand for , , and write if the difference of two functions and is uniformly bounded.
The bounded fluctuations of and in the directions and yield the existence of real functions and such that and .
Further, since , the bounded fluctuations of in the direction yield the existence of a real continuous function such that .
Thus
From functional equations to planarity.
Fix to get .
Fix to get .
Hence
Since , one can replace by , getting the functional equation
This easily yields the linearity of (up to bounded fluctuations), thus the linearity of , , , and, finally, .
The thickness is moreover uniformly bounded because the lifts are all Lipschitz surfaces with a common constant.
This completes the proof.
The second lemma shows that the condition on subperiods is actually necessary:
Lemma 2
If the subperiods of a codimension two rhombus tiling enforce irrational planarity then three of them, each in a shadow with only one subperiod, can be lifted in an irrational nondegenerated plane onto pairwise noncollinear vectors.
Proof.
Let be a planar codim. tiling with an irrational nondegenerated slope whose subperiods enforce planarity.
As in Lem. 1, there is a plane with at least the subperiods of such that .
Let denote the projection onto the shadow which contains .
Let and denote the lift of respectively in and .
The proof shall be by contradiction.
Let us separate two cases.
Case 1: The subperiods, once lifted in , belong to at most two lines.
Assume that there are exactly two such lines, say and (this is all the more true if there are only one line).
For any two real functions of a real variable and , define
For such that the lift of belong to , say , one has
It follows that is a period of as soon as is stable under the translation .
Similarly, for such that the lift of belong to , say , is a period of as soon as is stable under the translation .
For such functions and , consider a tiling whose lift lies in (that is, an approximation of ).
It has the same subperiods as .
But it is not necessarily planar: take, for example, .
This yields the wanted contradiction.
Case 2: There are at most two shadows with only one subperiod.
Assume that there are exactly two such shadows, say those with subperiods and (this is all the more true if there are less such shadows)
For , let and be the lifts of , respectively in and .
We define as above.
For , , so that is a period of as soon as is stable under the translation .
For , has at least one subperiod by definition of the ’s, hence two because of our initial hypothesis.
This is thus a rational plane of , hence equal to its algebraic conjugate .
It follows that .
In particular, is periodic.
So, again, we can choose and to obtain a non planar tiling which has the same subperiods as .
This yields the wanted contradiction.
The last lemma shows that the condition on subperiods is satisfied in particular when superiods characterize only finitely many slopes (that is a necessary condition to have local rules with our method):
Lemma 3
If the subperiods of a codimension two rhombus tiling characterize finitely many slopes, then they enforce irrational planarity.
Proof.
If the subperiods do not enforce irrational planarity, then one can take and for any and in the proof of the previous lemma: this yields infinitely many slopes with these subperiods.
4 Higher codimension
4.1 A partial result and a conjecture
In codimension two (that is, for tilings whose lift lives in ), Theorem 1 provides a necessary and sufficient condition on the subperiods of a tiling to ensure that it is planar.
The codimension two case can then be helpful to solve higer codimension cases.
Indeed, consider the projections of a tiling onto the space generated by four basis vector (those are a kind of generalization of the shadows, Def 2).
This yields codimension two tilings to which Theorem 1 can be applied.
We can then use the (eventual) planarity of these projections to (eventually) get the planarity of the original tiling.
We shall see successful cases in the following sections, namely the famous Penrose tilings (actually, a slightly generalized version) and a codimension four tiling based on cubic irrationality (whose main interest, beyond illustrating the method, is to show that cubic irrationality can be already obtained in codimension four).
However, we think that there are tilings whose subperiods enforce planarity, although no projection on four basis vectors does have subperiods which enforce its planarity. That is, the above method is not expected to always work. Moreover, this do not provide a full characterization of planarity in higher codimension. Nevertheless, we conjecture that Corollary 1 naturally extends:
Conjecture 1
If there are only finitely many slopes with the same subperiods as a given slope, then this slope admits local rules.
In other words, we conjecture that if subperiods yield enough constraints on planar tilings to enforce their slope, then they a fortioti yield enough constraints on tilings to enforce their planarity.
4.2 First example: generalized Penrose tilings
Discovered by Penrose in the 70’s [26], the Penrose tilings appear in a number of versions (see, e.g., [11]). Thoses with rhombus tiles have been shown by de Bruijn [5] to be strongly planar with a lift in whose slope is generated by the two vectors and , . This slope has Grassmann coordinates , where is the golden ratio, and can also be generated by
We here consider socalled generalized Penrose tilings, introduced in [17], which are the strongly planar rhombus tilings whose slope is parallel to the one of Penrose tilings (recall that the slope is an affine plane). They have ten subperiods (one in each shadow), associated with the equations
Let us normalize to and write . There are five Plücker relations, which all reduce to the unique equation , so that is equal to the golden ratio or its algebraic conjugate. The subperiods thus characterize finitely many slopes: it suffices to show that they also enforce planarity to prove that generalized Penrose tilings admit local rules. For that, project the slope onto the first four basis vectors. It yields a slope which has four subperiods associated with the equations
We can thus apply Theorem 1: this projection stays at bounded distance from the plane . Consider now the cartesian product of this plane with the line generated by the fifth basis vector: it is a threedimensional vectorial space from which the tiling stays at bounded distance. The same holds (by circular permutation of the indices) for the other projections on four of the five basis vectors, so that the tiling stays at bounded distance from the intersection of five threedimensional vector spaces. The twodimensionality of this intersection shall yields the planarity of the tilings. Consider a point in this intersection. There are real numbers and such that , where denotes the projection on the space generated by all the basis vectors but . One checks that the ’s are necessarily all equal to , and that the ’s are necessarily all equal to . This yields the wanted twodimensionality of the intersection. In conclusion, as conjectured in [17] and later proven in [29], the generalized Penrose tilings admit local rules. Namely, the local rules which enforce the subperiods of the generalized Penrose tilings (Prop. 3). One also has a bound on the diameter of the local rules, namely the largest subperiod lift (in the Penrose slope). A computation yields the bound .
4.3 Second example: a cubic dodecagonal tiling
Let us consider an example in , namely the codimension four planes satisfying
According to Propositions 3 and 5, these relations on Grassmann coordinates can be enforced by local rules. One checks that, together with the Plücker relations, this form a zerodimensional system with three real solutions:
where and . A basis is given by
It remains to show that subperiods also enforce planarity. Fix a tiling which has the above subperiods. We shall consider two of its projections. First, project orthogonally onto the space generated by , , and . The subperiods yield
We can thus apply Theorem 1: this projection of stays at bounded distance from a plane, which can only be the projection of a solution of the whole system, that is, , which is generated, e.g., by and . Second, project orthogonally onto the space generated by , , and . The subperiods yield
We can thus apply Theorem 1: this projection of stays at bounded distance from a plane, which can only be the projection of a solution of the whole system, that is, , which is generated, e.g., by and . Now, consider the vectorial space which projects onto the two above slopes. The lift of thus stays at bounded distance from . The planarity shall follow once we prove that has dimension at most two. Let . There are numbers , , and such that
One easily checks that these equations yield that , , and are completly determined by and .
This shows that has dimension at most two, whence the planarity of .
In conclusion, the slope , where is a root of and , does admit local rules. One also has a bound on the diameter of the local rules, namely the largest subperiod lift (in the above slope): a computation yields the upper bound .
4.4 Tilings with fold rotational symmetry
Definition 3
A rhombus tiling is said do be fold if it is strongly planar with a slope parallel to the plane generated by and , where range from to either if is odd, or from to if is even.
The name comes from the fact that these tilings contain arbitrarily large balls with a fold rotational symmetry (one speaks about local fold symmetry).
Fig. 11 illustrates the cases and .
Let us stress that fold tilings lift in for odd , but in for even : this is because adopting the same definition for both cases would yield pairs of collinear vectors for even .
We already met fold tilings in this paper: the AmmannBeenker tilings (Fig. 4) are indeed fold and the generalized Penrose tilings (Fig. 8) are fold.
The Grassmann coordinates of a fold tiling are
It shall be convenient to set for odd, for even, and for any . For , there is a subperiod associated with
There are no other subperiod, except for , where the rationality of yields for each two subperiods associated with
We say that a set of Grassmann coordinates are free if each of them can be chosen independently withou violating the Plücker relations. We shall use:
Lemma 4
The ’s with are free and determine all the other ones.
Proof. We first prove by induction on that these Grassmann coordinates determine those with . There is nothing to prove for and . Fix and assume that any Grassmann coordinate with is characterized. Then, for , the Plücker relation
shows that depends only on coordinates with .
The claim follows by induction.
Now, since there are as many Grassmann coordinates with as coordinates in two vectors which generate a plane (that is, twice the dimension of the space), these Grassmann coordinates are free.
We first show that, except when is a multiple of , the only planar rhombus tilings with the same subperiods as the fold tilings are the fold tilings:
Proposition 6
If does not divide , then the Plücker relations and thoses associated with the subperiods of a fold tiling form a zerodimensional system.
Proof. Let if is odd, or if is even. Subperiods enforce
Since does not divide , is odd, and subperiods enforce
The Plücker relation
can then be rewritten
With and , this yields the recurrence relation
which is exactly the one defining Chebyshev polynomials of the second kind.
Thus is one of the finitely many solutions of .
The zerodimensionality follows from Lemma 4.
In contrast, when is a multiple of , there is a oneparameter family of planar rhombus tilings with the same subperiods as the fold tilings:
Proposition 7
If divides , then the Plücker relations and thoses associated with the subperiods of a fold tiling form a onedimensional system.
Proof. Let if is odd, or if is even. Subperiods enforce
Since divides , is even, and subperiods now only enforce
With , and , the relation
now yields the recurrence relation