This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

A new simple family of non-periodic tilings with square tiles

Nikolay Vereshchagin
Moscow State University, HSE University, Yandex
This paper was prepared within the framework of the HSE University Basic Research Program.
Abstract

We define a new family of non-periodic tilings with square tiles that is mutually locally derivable with some family of tilings with isosceles right triangles. Both families are defined by simple local rules, and the proof of their non-periodicity is as simple as that of the non-periodicity of Robinson’s tilings.

Keywords: non-periodic tilings, Domino problem, aperiodic tile sets, substitution tilings

1 Introduction

The study of non-periodic tilings of the plane by square tiles is motivated by the Domino problem: to construct an algorithm that, given local rules to attach tiles, finds out whether it is possible to tile the entire plane according to these rules. The non-existence of such an algorithm was proved by Berger in [2]. The main step in the proof is the construction of local rules such that any tiling according to these rules is non-periodic. The construction of such a family was subsequently simplified by Robinson [5]. An even simpler construction using the same idea is given in [3].

In this paper, we propose a new such family. The local rules for these tilings and the proof of non-periodicity are approximately as easy as those in [5] and [3]. The novel thing is that our tilings are based on tilings by isosceles right triangles. In fact, we first construct a family of non-periodic tilings with triangles for which the local rules ensure that the triangles can be grouped into square tiles. Then we rewrite the local rules for triangle tilings as local rules to attach resulting square tiles. Similarly, tilings by isosceles triangles with angles divisible by 3636^{\circ} yield Penrose tilings P3 by rhombuses, which is called the Robinson decomposition of Penrose tilings. To use conventional terminology, our square tilings are mutually locally derivable to triangular tilings.

In the next section, we define our family of tilings with square tiles, and in Section 3 we define tilings with triangles and provide proofs. The proof of the non-periodicity of tilings by triangles (Theorem 3), and hence of the non-periodicity of the family of tilings by square tiles (Theorem 1), uses a well-known technique based on self-similarity. Namely, we consider the following composition scheme: two triangles with a common leg are combined into one triangle. Applying this scheme to any tiling satisfying local rules we obtain a new tiling that again satisfies the same rules. It is well known that any family of tilings with such a property can only consist of non-periodic tilings. Moreover, we prove that all tilings in our family are substitution tilings (Theorem 4). This means that any its finite fragment occurs in some supertile. The latter are defined as tilings that can be obtained from single tiles by several decompositions.

2 Tilings with square tiles

Our tiles are shown in Fig. 1.

Refer to caption
Figure 1: The tiles.

The sides drawn in black have one of two orientations and one of two colors, green or red. Thus, each of the four pictures depicts 44=2564^{4}=256 different tiles. In addition, these tiles can be rotated by angles that are multiples of 9090^{\circ}.111It may seem that the second tile is obtained from the first by 180180^{\circ} rotation, and the fourth from the third. However, this is not the case — with such a rotation, the slanted arrow coming from the upper right corner would change its color. Tiles cannot be flipped. Thus, the total number of tiles is 46=40964^{6}=4096. A specific tile is shown in Fig. 2.

Refer to caption
Figure 2: A tile.

The local rules:

  1. (1)

    Tiles are attached only side-to-side, and the shared sides must have matching colors and orientations.

  2. (2)

    Adjacent triangles must have different colors.

  3. (3)

    We will call the crossing centered at a given vertex the set of arrows entering or leaving this vertex. The rule restricts possible crossings: only the crossings shown in Fig. 3 are legal, as well as crossings obtained from them by rotations by angles that are multiples of 4545^{\circ}.

    Refer to caption
    Figure 3: Legal crossings.

    Legal crossings can be described as follows: a pair of arrows passes through the center of the crossing without changing color or direction. This pair of arrows is called the axis of the crossing. There are also two arrows of different colors perpendicular to the axis, entering the center. In addition to these four arrows, there are four more, coming out of the center at an angle of 4545^{\circ} to the axis. If you go to the center of the crossing perpendicular to the axis, then the green arrow goes to the right, and the red arrow to the left.

Definition 1.

A tiling is a set of tiles whose interiors are pair wise disjoint. A correct tiling by square tiles is a tiling of the whole plane with the above tiles that satisfies these rules.

Theorem 1.

There is a correct tiling with square tiles, and any such tiling is non-periodic.

The proof of the second part of this theorem uses the unique composition property. In any tiling of the plane, tiles can be grouped in a unique way into the so-called macro-tiles. Each macro-tile corresponds to some tile of the original set, and when macro-tiles are replaced by the corresponding tiles, the local rules are preserved.

This method will not be applied to the original tilings, but to tilings with isosceles right triangle obtained from the original tilings as follows. Let us cut each tile into 4 right-angled triangles along the diagonal arrows. We obtain a tiling with triangles. The original local rules become local rules for triangular tiles. To these rules, we add yet another rule that guarantees that triangles join into square tiles. In any tiling, according to the rules obtained, the tiles are divided into pairs of tiles with a common leg. Each such pair will correspond to one triangular tile, and when replacing it with the corresponding tile, the local rules will be preserved. This operation is called the composition. Since the local rules are preserved, the triangles in the resulting tiling should again join into square tiles. However, new square tiles can be composed of triangles from different square tiles in the original tiling. Therefore, composition can be defined only for tilings with triangles, but not for tilings with square tiles.

A similar technique is also used in the proof of the non-periodicity of Penrose tilings P3 by rhombuses of two shapes. The rhombuses are also partitioned into triangles, which is called the Robinson decomposition. Robinson rectangles can be grouped into larger rectangles, which again can be grouped into rhombuses.

So, we move on to tilings with triangular tiles.

3 Tilings with triangles

3.1 Tiles and local rules

The tiles are isosceles right triangles colored red or green. Each side of a tile has an orientation and a color, either red or green. Thus each tile is specified by seven bits. In addition, tiles can be rotated by 90-degree angles, so the number of tiles is 29=5122^{9}=512 up to shift. Two examples of tiles are shown in Fig. 4.

Refer to caption
Figure 4: Examples of triangular tiles.

Each correct tiling with square tiles corresponds to a tiling with triangles, which is obtained as follows. We cut each square tile diagonally into four triangles. This will result in a tiling with triangular tiles of the type described above. Obviously, it satisfies the following local rules:

  1. (1)

    The tiles are attached side by side, and the shared sides of adjacent tiles have matching colors and orientations.

  2. (2)

    Any two triangles with a common side have different colors.

  3. (3)

    Only two types of crossings are allowed, C4C_{4} and C8C_{8} (Fig. 5).

    Refer to caption
    Refer to caption
    Figure 5: Allowed crossings. The two sides painted purple must have the same color (red or green). Crossings of the form C4C_{4} can be rotated by multiples of 9090^{\circ}, and crossings of the form C8C_{8} can be rotated by multiples of 4545^{\circ}.

    Crossings of the form C8C_{8} are exactly legal crossings for tilings with square tiles. Crossings of the form C4C_{4} appear at the centers of square tiles when they are cut into triangles.

  4. (4)

    If we go to the center of the C4C_{4} crossing perpendicular to the axis, then there should be a red triangle on the left, and a green triangle on the right. The axis of the C4C_{4} crossing is defined similarly to the axis of C8C_{8}, as the pair of uni-color unidirectional arrows passing through the center.

We will call tilings that satisfy these local rules correct triangle tilings. For tilings of parts of the plane, we require that the third and fourth conditions hold only for internal vertices.

Lemma 1.

(a) If a correct tiling TT with square tiles is cut into triangles, then a correct tiling TT^{\prime} with triangles is obtained. (b) Conversely, any correct triangular tiling TT^{\prime}of the plane can be obtained from some correct tiling TT with square tiles by cutting it into triangles. This tiling TT is unique.

Proof.

(a) Conditions (1) and (2) for TT^{\prime} follow from conditions 1 and 2 for TT.

Condition (3): every crossing in TT^{\prime} either coincides with the corresponding crossing in TT and hence is of the form C8C_{8}, or is the crossing in the center of a tile in TT^{\prime} and hence is of the form C4C_{4}.

Condition (4) is verified by hand.

(b) Since in a correct tiling of the plane by triangles there can only be a crossing C4C_{4} at the vertex of any right angle, its tiles can be grouped into quadruples, each of which forms a square tile from our set. Obviously, this partition is unique.

Since the local rules for tilings by squares essentially coincide with the local rules for tilings by triangles, the tiling TT is correct. ∎

Thus, to prove Theorem 1 we have to prove the existence and non-periodicity of correct tilings by triangles.

3.2 Substitution

To prove existence and non-periodicity of correct tilings by triangles, consider the following substitution: each triangular tile is cut by its height into two tiles similar to the original one with the ratio 2\sqrt{2}. The height is oriented from the vertex of the right angle to the hypotenuse and has the same color as the original tile. The triangle left from the height, when viewed in the direction of the arrow, is called left, it is colored red, and the right triangle is called right, it is colored green (Fig. 6). All sides (including the two halves of the hypotenuse) of the original triangle retain their color and orientation.

Refer to caption
Figure 6: Substitution. The sides drawn in black can have any color and orientation, which are carried over to the sides of the resulting tiles.

For example, applying the substitution to the left tile in Fig. 4, we will get a tiling in Fig. 7.

Refer to caption
Figure 7: An example of applying the substitution

Using this substitution, we define the operations of decomposition and composition of the given tiling. To decompose a tiling, we apply the substitution to all its tiles. The resulting tiling tiles the same part of the plane with smaller tiles. This tiling is then stretched by a factor of 2\sqrt{2}, and the resulting tiling is called the decomposition the original tiling. It is easy to see that the decomposition operation is injective. Indeed, we call two tiles siblings if they are obtained by substitution from the same tile. Then for each tile FF there exists a unique sibling GG, provided we ignore the color and orientation of edges. Indeed, if FF is a red tile, then the only its sibling is the green tile obtained from FF by 9090^{\circ} rotation counterclockwise, with respect to the vertex of the right angle of FF. If FF is a green tile, then the rotation is clockwise.

Thus, for each tiling, there is at most one tiling of which it is the decomposition. If such a tiling exists, then it is called the composition of the original tiling. The decomposition of the tiling TT will be denoted by σT\sigma T, and the composition by σ1T\sigma^{-1}T.

3.3 Supertiles

A level nn supertile is the nn-fold decomposition of a single tile. Fig. 8 shows a level 6 supertile obtained by 66-fold decomposition from the left tile in Fig. 7.

Refer to caption
Figure 8: Supertile S6S_{6}. Long arrows represent sequences of equally oriented and equally colored short arrows

Supertiles of level nn will be denoted by SnS_{n}.

Remark 1.

It can be proven by induction that only three (not 8) different side orientations of inner red tiles and three different side orientations of inner green tiles occur in supertiles (Fig. 9). Therefore, we can assume that the total number of triangular tiles is (3+3)84=192(3+3)\cdot 8\cdot 4=192 (and not 512).

Refer to caption
Figure 9: Orientations of the sides of tiles occurring in supertiles.

3.4 Existence of tilings satisfying local rules

First we prove the existence of correct tilings by triangles of the entire plane. To do this, it suffices to prove that all supertiles satisfy the local rules. Why is this enough? For example, we can argue as follows: we can verify that the S6S_{6} supertile in Fig. 8 contains strictly inside the tile in Fig. 7 on the left, from which this supertile was obtained by sixfold decomposition. Therefore, if we apply the sixfold decomposition to the supertile in Fig. 8, we will get a supertile S12S_{12} including the tiling S6S_{6}. Iterating this operation, we get a tower of supertiles

S0S6S12S18,S_{0}\subset S_{6}\subset S_{12}\subset S_{18}\subset\dots,

whose union is a correct tiling of the entire plane. Thus, it suffices to prove the following

Lemma 2.

Any supertile is a correct tiling.

Proof.

This is proved by induction. The induction base is trivial, since any tile constitutes a correct tiling.

For the inductive step, we have to show that the decomposition of a correct tiling TT is again correct. But there is a problem here. This is true for tilings of the plane, but not for tilings of its parts. For example, a tiling consisting of two triangles with a common leg in Fig. 10,

Refer to caption
Figure 10: The decomposition a correct tiling of a part of the plane may not be correct.

is correct (the third condition is satisfied because there are no internal vertices), but its decomposition is not. To make the inductive step, it is necessary to impose a restriction on the crossings at the boundary points. To prove the lemma, it will suffice to require that the crossings with the center at any vertex of the boundary, except for the extreme ones, are halves of the legal crossings, that is, they have one of the two forms in Fig. 11.

Refer to caption
Refer to caption
Figure 11: Allowed crossings on the boundary of a supertile. The purple sides must have the same color, red or green.

Now we can make the inductive step. Assume that TT is a supertile and is correct. We have to show that so is its decomposition σT\sigma T. It is obvious that the first condition (tiles border side by side and colors and orientations of shared sides match) is inherited during decomposition.

Let us verify the second condition (adjacent triangles have different colors) for σT\sigma T. Let FF be a tile in σT\sigma T and let GG be its sibling. W.l.o.g. assume that FF is a right, and hence green, tile (Fig. 12).

Refer to caption
Figure 12: All neighbors of a green tile FF in the decomposition are red.

We need to prove that all neighbors of FF are red.

The tile GG is red by definition of the substitution. Besides GG, the tile FF can have other neighbors. Namely, if the hypotenuse of II does not lie on the edge of TT, then the tiling TT contains the tile EE bordering II along the hypotenuse. As a result of cutting EE, two tiles will appear, of which it is the left, and therefore red, tile that borders FF along the leg.

Moreover, if the leg of the tile II does not lie on the boundary of the supertile, then the tiling TT contains the tile HH, which is the reflection of the tile II with respect to this leg. Indeed, otherwise the crossing centered at the vertex AA would be illegal (right and acute angles cannot converge at a legal crossing). When the tile HH is decomposed, it is the left, and therefore red, tile that is adjacent to FF.

Let us check the third condition for the tiling σT\sigma T (that all crossings are legal). To do this, we need to check that during decomposition, a legal crossing is converted into a legal one, and the same holds for half crossings in Fig. 11. This is done by a direct verification. In addition, we need to check that all the crossings at the new vertices are legal as well.

New vertices are the centers of hypotenuses of tiles from TT. The hypotenuse itself becomes the axis of the new crossing, and the new crossing is C4C_{4} by the definition of the substitution.

Finally, we check the fourth condition. The crossings of the form C4C_{4} are only the crossings at the centers of the hypotenuses of the tiles in TT, and by the definition of substitution, all the left triangles in them are red and the right ones are green.

The third and fourth conditions for crossings centered on the boundary are verified in a similar way. ∎

3.5 Non-periodicity of tilings satisfying local rules

The non-periodicity of correct tilings follows from the fact that any tiling of the plane has a structure in the following sense: for any nn it can be partitioned uniquely into level nn supertiles. This is a simple consequence of the following

Theorem 2.

Any correct tiling is composable and its composition is correct.

Proof.

Consider any tile of a given correct tiling TT and the vertex of its right angle. The crossing at this vertex is C4C_{4}. At this crossing, each tile has a sibling. Let us combine them into one, erasing the common leg, and leave all the colors and orientations as they were. The hypotenuse of the resulting triangle is formed by connecting two arrows on the axis of the crossing. Since they are equally colored and oriented, the hypotenuse will be correctly oriented and correctly colored. The resulting tiling is the composition of the original one. Let us prove that it is correct.

We are given that TT is correct and need to prove that σ1T\sigma^{-1}T is correct. First we verify condition (1), that is, prove that σ1T\sigma^{-1}T is side-to-side and shared sides have matching colors and orientations. This is obvious for the legs of the tiles from σ1T\sigma^{-1}T, since they are the hypotenuses of the tiles from TT, and by the condition (1) for TT the hypotenuses are adjacent to the hypotenuses of the same color and orientation.

Now let us prove the same for the hypotenuses of tiles from σ1T\sigma^{-1}T. Consider a tile FF from σ1T\sigma^{-1}T (Fig. 13(a)). W.l.o.g. assume that it is red. We need to show that the tile GG shown in Fig. 13(a) belongs to σ1T\sigma^{-1}T. To this end, consider the midpoint of the hypotenuse, denoted by the letter AA. The crossing centered on AA in the tiling TT can only be C4C_{4}, so there are two tiles in TT under the hypotenuse AA, as shown in Fig. 13(b). These two tiles, when composed, give the sought tile GG.

Refer to caption
Figure 13: Two types of neighborhoods of tiles in the composed tiling.

As a bi-product of this argument, we see that the colors of the tiles FF and GG are different because the colors of the vertical arrows at the crossing C4C_{4} are different. Therefore, condition (2) is satisfied for triangles σ1T\sigma^{-1}T with a common hypotenuse. Let us verify condition (2) for tiles that share a leg. Let the tiles FF and GG have a common leg (Fig. 13(c)). Then their colors are equal to the colors of two arrows in the tiling TT (Fig. 13(d)), connecting the point AA, the common vertex of right angles of FF and GG, with the centers of their hypotenuses. These two arrows form a right angle and at their common origin (point AA) there can only be the crossing C8C_{8} in the tiling TT. By a routine check, we can see that any two orthogonal arrows with a common origin at the center of the crossing C8C_{8} have different colors.

Let us verify condition (3). In the course of composition, the crossings C4C_{4} disappear. We need to show that crossings of the form C8C_{8} are transformed into themselves or into C4C_{4}. In all crossings C8C_{8} the sides of the tiles adjacent to the center of the crossing alternate — hypotenuse, leg, hypotenuse, and so on. And the colors of the tiles also alternate. Therefore, 4 options arise, depending on whether the alternation of colors begins with red or green, and the alternation of sides — from the leg or hypotenuse. These four options are shown in Fig. 14.

Refer to caption
Figure 14: Four types of filling C8C_{8} crossing.

Let us first prove that the first option is impossible. Indeed, the crossings at the lower and upper blue points cannot be legal. Indeed, the axes of these crossings must be directed vertically, since otherwise an arrow would go from its center in the direction orthogonal to the axis. For the upper crossing, the axis should be directed downwards, and for the lower one, upwards. But then the colors of both triangles with a vertex at the blue points should be opposite to the existing colors.

In the next two crossings, the siblings to all tiles are not adjacent to the crossing. For this reason, when composed, the crossings do not change. Finally, in the fourth case, the sibling for each tile is also adjacent to the center. When decomposed, the eight tiles produce four tiles, and we get the crossing C4C_{4}. In this case, condition (4) is satisfied for the resulting crossing C4C_{4}. Indeed, in any C8C_{8} crossing, the red arrow goes to the left of the arrow entering its center, and the green arrow goes to the right. Hence a red triangle is to the left of the arrow entering the center of the obtained C4C_{4} crossing, and a green one to the right. ∎

Theorem 3.

Any correct tiling of the plane by triangles is non-periodic. Consequently, any correct tiling by square tiles is also non-periodic.

Proof.

Let TT be a correct tiling of the plane by triangles and σ1T\sigma^{-1}T be its composition. Assume that a0a\neq 0 is its period, that is T=T+aT=T+a. Then the vector a/2a/\sqrt{2} is the period of σ1T\sigma^{-1}T. Indeed,

σ1T=σ1(T+a)=(σ1T)+a/2.\sigma^{-1}T=\sigma^{-1}(T+a)=(\sigma^{-1}T)+a/\sqrt{2}.

It is proved similarly that a/2a/2 is the period of the double composition of TT. Repeating this argument many times, we get a tiling whose period is much less than the size of the tiles, which is impossible. ∎

3.6 Substitution tilings

Definition 2.

A tiling is called a substitution tiling (for the given substitution) if every its finite fragment occurs in a supertile.

Since supertiles are correct tilings, any substitution tiling is correct. It turns out that the opposite is also true.

Theorem 4.

Any correct tiling of the plane by triangles is a substitution tiling.

Proof.

Consider any fragment PP of a correct tiling TT of the plane. We have to show that PP occurs in a supertile. To this end add in PP a finite number of tiles from TT so that PP becomes an inner part of the resulting fragment QQ of TT.

By Theorem 2 for any kk we can compose the given tiling kk times and the resulting tiling σkT\sigma^{-k}T is correct. Call a crown in σkT\sigma^{-k}T centered at a vertex AA of a tile in σkT\sigma^{-k}T the set of all tiles from σkT\sigma^{-k}T that include AA. Since σkT\sigma^{-k}T is a correct tiling, all its crowns have a form shown on Fig. 15 (see the proof of Th. 2).

Refer to caption
Figure 15: Crowns in a correct tiling. Black and and purple sides can have any colors and orientations. The purple sides must have matching colors and orientations.

Consider the sets of the form σkC\sigma^{k}C where CC is a crown within the tiling σkT\sigma^{-k}T. As kk increases, these sets increase as well. If kk is large enough, then the set QQ is covered by a single such set, say by σkC\sigma^{k}C, that is, QσkCQ\subset\sigma^{k}C. As σkT\sigma^{-k}T is a correct tiling, it can have only crowns shown on Fig. 15.

Let us show that all crowns from Fig. 15 appear in supertiles provided we ignore colors and orientations of its outer sides (shown in black color on Fig. 15). For crowns of the form (a) it can be verified by hand: all the four such crowns occur within supertiles S5S_{5} shown on Fig. 16.

Refer to caption
Refer to caption
Figure 16: On diagonals of supertiles S5S_{5}, there are all the four crowns of the form (a).

Again it is easy to verify by hand that the substitution transforms the crowns as follows: (a)\to(b)\to(c)\to(d)\to(c). Hence all the four crowns (b) occur within supertiles S6S_{6}, the crowns (c) within supertiles S7S_{7}, and the crowns (d) within supertile S8S_{8}.

It follows that the crown CC, whose kk-fold decomposition covers QQ, appears in a supertile, say in SnS_{n}. Therefore the tiling σkC\sigma^{k}C appears in the supertile Sn+kS_{n+k}. Hence the patch QQ appears in that supertile provided we ignore colors and orientations of its outer sides. Since PQP\subset Q and no side of the patch PP is an outer side of QQ, we are done. ∎

4 Acknowledgments.

The author is sincerely grateful to the participants of the Kolmogorov seminar and of the International academic conference “Graphs, Games and Models” (October 12-15, 2022, Maikop, Adygea) for helpful discussions.

References

  • [1] 9
  • [2] Robert Berger, The undecidability of the domino problem, Memoirs of the American Mathematical Society, 66 (1966) 1–2.
  • [3] Bruno Durand, Leonid Levin, Alexander Shen. Local rules and global order, or aperiodic tilings. The Mathematical Intelligencer, 27:1 (2005) 64–68
  • [4] Roger Penrose, Pentaplexity, Eureka, 39 (1978) 16–22.
  • [5] Raphael Robinson, Undecidability and nonperiodicity of tilings in the plane, Invent. Math., 12 (1971) 177-209