Self-tiling tile set

Figure 1:  A 'perfect' self-tiling tile set of order 4

A self-tiling tile set, or setiset, of order n is a set of n shapes or pieces, usually planar, each of which can be tiled with smaller replicas of the complete set of n shapes. That is, the n shapes can be assembled in n different ways so as to create larger copies of themselves, where the increase in scale is the same in each case. Figure 1 shows an example for n = 4 using distinctly shaped decominoes. The concept can be extended to include pieces of higher dimension. The name setisets was coined by Lee Sallows in 2012,[1][2] but the problem of finding such sets for n = 4 was asked decades previously by C. Dudley Langford, and examples for polyaboloes (discovered by Martin Gardner, Wade E. Philpott and others) and polyominoes (discovered by Maurice J. Povah) were previously published by Gardner.[3]

## Contents

* 1 Examples and definitions
* 2 Inflation and deflation
* 3 Loops
* 4 Methods of construction
* 5 References
* 6 External links

## Examples and definitions[edit]

Figure 2:  A setiset with duplicated piece.

From the above definition it follows that a setiset composed of n identical pieces is the same thing as a 'self-replicating tile' or rep-tile, of which setisets are therefore a generalization.[4] Setisets using n distinct shapes, such as Figure 1, are called perfect. Figure 2 shows an example for n = 4 which is imperfect because two of the component shapes are the same.

The shapes employed in a setiset need not be connected regions. Disjoint pieces composed of two or more separated islands are also permitted. Such pieces are described as disconnected, or weakly-connected (when islands join only at a point), as seen in the setiset shown in Figure 3.

The fewest pieces in a setiset is two. Figure 4 encapsulates an infinite family of order 2 setisets each composed of two triangles, P and Q. As shown, the latter can be hinged together to produce a compound triangle that has the same shape as P or Q, depending upon whether the hinge is fully open or fully closed. This unusual specimen thus provides an example of a hinged dissection.

Figure 3:  A setiset showing weakly-connected pieces.

Figure 4:  An infinite family of order 2 setisets.

## Inflation and deflation[edit]

Figure 5:  A setiset of order 4 using octominoes. Two stages of inflation are shown.

The properties of setisets mean that their pieces form substitution tilings, or tessellations in which the prototiles can be dissected or combined so as to yield smaller or larger duplicates of themselves. Clearly, the twin actions of forming still larger and larger copies (known as inflation), or still smaller and smaller dissections (deflation), can be repeated indefinitely. In this way, setisets can produce non-periodic tilings. However, none of the non-periodic tilings thus far discovered qualify as aperiodic, because the prototiles can always be rearranged so as to yield a periodic tiling. Figure 5 shows the first two stages of inflation of an order 4 set leading to a non-periodic tiling.

## Loops[edit]

Figure 6:  A loop of length 2 using decominoes.

Besides self-tiling tile sets, which can be interpreted as loops of length 1, there exist longer loops, or closed chains of sets, in which every set tiles its successor.[5] Figure 6 shows a pair of mutually tiling sets of decominoes, in other words, a loop of length 2. Sallows and Schotel did an exhaustive search of order 4 sets that are composed of octominoes. In addition to seven ordinary setisets (i.e., loops of length 1) they found a bewildering variety of loops of every length up to a maximum of 14. The total number of loops identified was nearly one and a half million. More research in this area remains to be done, but it seems safe to suppose that other shapes may also entail loops.[6]

## Methods of construction[edit]

To date, two methods have been used for producing setisets. In the case of sets composed of shapes such as polyominoes, which entail integral piece sizes, a brute force search by computer is possible, so long as n, the number of pieces involved, is not prohibitive. It is easily shown that n must then be a perfect square.[4] Figures 1,2,3,5 and 6 are all examples found by this method.

Alternatively, there exists a method whereby multiple copies of a rep-tile can be dissected in certain ways so as to yield shapes that create setisets. Figures 7 and 8 show setisets produced by this means, in which each piece is the union of 2 and 3 rep-tiles, respectively. In Figure 8 can be seen how the 9 pieces above together tile the 3 rep-tile shapes below, while each of the 9 pieces is itself formed by the union of 3 such rep-tile shapes. Hence each shape can be tiled with smaller duplicates of the entire set of 9.[4]

Figure 7:  A rep-tile-based setiset of order 4.

Figure 8:  A rep-tile-based setiset of order 9.

## References[edit]

1. ^ Sallows, Lee (December 2012). "On Self-Tiling Tile Sets". Mathematics Magazine. 85 (5): 323–333. doi:10.4169/math.mag.85.5.323.
2. ^ Alejandro Erickson on Self-tiling tile sets
3. ^ Polyhexes and Polyaboloes in Mathematical Magic Show, by Martin Gardner, Knopf, 1977, pp 146-159
4. ^ a b c Sallows, Lee (April 2014). "More On Self-Tiling Tile Sets". Mathematics Magazine. 87 (2): 100–112. doi:10.4169/math.mag.87.2.100.
5. ^ Geometric Hidden Gems by Jean-Paul Delahaye in Scilogs, April 07, 2013
6. ^ Self-Tiling Tile Sets website

## External links[edit]

* Self-Tiling Tile Sets website

* v
* t
* e

Tessellation

Periodic

* Pythagorean
* Rhombille
* Schwarz triangle
* Rectangle
* Domino
* Uniform tiling and honeycomb
* Coloring
* Convex
* Kisrhombille
* Wallpaper group
* Wythoff

Aperiodic

* Ammann–Beenker
* Aperiodic set of prototiles
* List
* Einstein problem
* Socolar–Taylor
* Gilbert
* Penrose
* Pentagonal
* Pinwheel
* Quaquaversal
* Rep-tile and Self-tiling
* Sphinx
* Truchet

Other

* Anisohedral and Isohedral
* Architectonic and catoptric
* Circle Limit III
* Computer graphics
* Honeycomb
* Isotoxal
* List
* Packing
* Problems
* Domino
* Wang
* Heesch's
* Squaring
* Prototile
* Conway criterion
* Girih
* Regular Division of the Plane
* Regular grid
* Substitution
* Voronoi
* Voderberg

By vertex type

| Spherical|

* 2n
* 33.n
* V33.n
* 42.n
* V42.n

|

Regular|

* 2∞
* 36
* 44
* 63

Semi-
regular|

* 32.4.3.4
* V32.4.3.4
* 33.42
* 33.∞
* 34.6
* V34.6
* 3.4.6.4
* (3.6)2
* 3.122
* 42.∞
* 4.6.12
* 4.82

Hyper-
bolic|

* 32.4.3.5
* 32.4.3.6
* 32.4.3.7
* 32.4.3.8
* 32.4.3.∞
* 32.5.3.5
* 32.5.3.6
* 32.6.3.6
* 32.6.3.8
* 32.7.3.7
* 32.8.3.8
* 33.4.3.4
* 32.∞.3.∞
* 34.7
* 34.8
* 34.∞
* 35.4
* 37
* 38
* 3∞
* (3.4)3
* (3.4)4
* 3.4.62.4
* 3.4.7.4
* 3.4.8.4
* 3.4.∞.4
* 3.6.4.6
* (3.7)2
* (3.8)2
* 3.142
* 3.162
* (3.∞)2
* 3.∞2
* 42.5.4
* 42.6.4
* 42.7.4
* 42.8.4
* 42.∞.4
* 45
* 46
* 47
* 48
* 4∞
* (4.5)2
* (4.6)2
* 4.6.12
* 4.6.14
* V4.6.14
* 4.6.16
* V4.6.16
* 4.6.∞
* (4.7)2
* (4.8)2
* 4.8.10
* V4.8.10
* 4.8.12
* 4.8.14
* 4.8.16
* 4.8.∞
* 4.102
* 4.10.12
* 4.122
* 4.12.16
* 4.142
* 4.162
* 4.∞2
* (4.∞)2
* 54
* 55
* 56
* 5∞
* 5.4.6.4
* (5.6)2
* 5.82
* 5.102
* 5.122
* (5.∞)2
* 64
* 65
* 66
* 68
* 6.4.8.4
* (6.8)2
* 6.82
* 6.102
* 6.122
* 6.162
* 73
* 74
* 77
* 7.62
* 7.82
* 7.142
* 83
* 84
* 86
* 88
* 812
* 8.62
* 8.162
* ∞3
* ∞4
* ∞5
* ∞∞
* ∞.62
* ∞.82

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template