Domino tiling

Domino tiling of a square

A domino tiling of a region in the Euclidean plane is a tessellation of the region by dominos, shapes formed by the union of two unit squares meeting edge-to-edge. Equivalently, it is a matching in the grid graph formed by placing a vertex at the center of each square of the region and connecting two vertices when they correspond to adjacent squares.

Height functions

For some classes of tilings on a regular grid in two dimensions, it is possible to define a height function associating an integer to the nodes of the grid. For instance, draw a chessboard, fix a node with height 0, then for any node there is a path from to it. On this path define the height of each node (i.e. corners of the squares) to be the height of the previous node plus one if the square on the right of the path from to is black, and minus one otherwise.

More details can be found in Kenyon & Okounkov (2005).

Thurston's height condition

William Thurston (1990) describes a test for determining whether a simply-connected region, formed as the union of unit squares in the plane, has a domino tiling. He forms an undirected graph that has as its vertices the points (x,y,z) in the three-dimensional integer lattice, where each such point is connected to four neighbors: if x+y is even, then (x,y,z) is connected to (x+1,y,z+1), (x-1,y,z+1), (x,y+1,z-1), and (x,y-1,z-1), while if x+y is odd, then (x,y,z) is connected to (x+1,y,z-1), (x-1,y,z-1), (x,y+1,z+1), and (x,y-1,z+1). The boundary of the region, viewed as a sequence of integer points in the (x,y) plane, lifts uniquely (once a starting height is chosen) to a path in this three-dimensional graph. A necessary condition for this region to be tileable is that this path must close up to form a simple closed curve in three dimensions, however, this condition is not sufficient. Using more careful analysis of the boundary path, Thurston gave a criterion for tileability of a region that was sufficient as well as necessary.

Counting tilings of regions

Domino tiling of an 8×8 square using the minimum number of long-edge-to-long-edge pairs (1 pair in the center). This arrangement is also a valid Tatami tiling of an 8x8 square, with no four dominoes touching at an internal point.

The number of ways to cover an rectangle with dominoes, calculated independently by Temperley & Fisher (1961) and Kasteleyn (1961), is given by

A special case concerns the number of ways of tiling a -rectangle. The number turns out to equal the n-th number in the Fibonacci sequence. (sequence A000045 in OEIS) (Klarner & Pollack 1980).

Another special case happens for squares with m = n = 0, 2, 4, 6, 8, 10, 12, ... is

1, 2, 36, 6728, 12988816, 258584046368, 53060477521960000, ... (sequence A004003 in OEIS).

These numbers can be found by writing them as the Pfaffian of an skew-symmetric matrix whose eigenvalues can be found explicitly. This technique may be applied in many mathematics-related subjects, for example, in the classical, 2-dimensional computation of the dimer-dimer correlator function in statistical mechanics.

The number of tilings of a region is very sensitive to boundary conditions, and can change dramatically with apparently insignificant changes in the shape of the region. This is illustrated by the number of tilings of an Aztec diamond of order n, where the number of tilings is 2^(n + 1)n/2. If this is replaced by the "augmented Aztec diamond" of order n with 3 long rows in the middle rather than 2, the number of tilings drops to the much smaller number D(n,n), a Delannoy number, which has only exponential rather than super-exponential growth in n. For the "reduced Aztec diamond" of order n with only one long middle row, there is only one tiling.

• 

  An Aztec diamond of order 4, with 1024 domino tilings

• 

  One possible tiling

See also

• Statistical mechanics
• Gaussian free field, the scaling limit of the height function in the generic situation (e.g., inside the inscribed disk of a large aztec diamond)
• Mutilated chessboard problem, a puzzle concerning domino tiling of a 62-square subset of the chessboard
• Tatami, floor mats in the shape of a domino that are used to tile the floors of Japanese rooms, with certain rules about how they may be placed

References

• Bodini, Olivier; Latapy, Matthieu (2003), "Generalized Tilings with Height Functions" (PDF), Morfismos 7 (1): 47–68, ISSN 1870-6525 .
• Faase, F. (1998). "On the number of specific spanning subgraphs of the graphs G X P_n". Ars Combin. 49: 129–154. MR 1633083. 
• Hock, J. L.; McQuistan, R. B. (1984). "A note on the occupational degeneracy for dimers on a saturated two-dimenisonal lattice space". Discrete Appl. Math. 8: 101–104. doi:10.1016/0166-218X(84)90083-0. MR 0739603. 
• Kasteleyn, P. W. (1961), "The statistics of dimers on a lattice. I. The number of dimer arrangements on a quadratic lattice", Physica 27 (12): 1209–1225, Bibcode:1961Phy....27.1209K, doi:10.1016/0031-8914(61)90063-5 .
• Kenyon, Richard (2000), "The planar dimer model with boundary: a survey", in Baake, Michael; Moody, Robert V., Directions in mathematical quasicrystals, CRM Monograph Series 13, Providence, RI: American Mathematical Society, pp. 307–328, ISBN 0-8218-2629-8, MR 1798998, Zbl 1026.82007 
• Kenyon, Richard; Okounkov, Andrei (2005), "What is … a dimer?" (PDF), Notices of the American Mathematical Society 52 (3): 342–343, ISSN 0002-9920 .
• Klarner, David; Pollack, Jordan (1980), "Domino tilings of rectangles with fixed width", Discrete Mathematics 32 (1): 45–52, doi:10.1016/0012-365X(80)90098-9, MR 588907, Zbl 0444.05009 .
• Mathar, Richard J. (2013). "Paving rectangular regions with rectangular tiles: tatami and non-tatami tilings". arXiv:1311.6135. 
• Propp, James (2005), "Lambda-determinants and domino-tilings", Advances in Applied Mathematics 34 (4): 871–879, arXiv:math.CO/0406301, doi:10.1016/j.aam.2004.06.005 .
• Ruskey, Frank; Woodcock, Jennifer (2009). "Counting fixed-height Tatami tilings". Electron. J. Combin 16 (1): R126. MR 2558263. 
• Sellers, James A. (2002), "Domino tilings and products of Fibonacci and Pell numbers", Journal of Integer Sequences 5 (Article 02.1.2) .
• Stanley, Richard P. (1985). "On dimer coverings of rectangles of fixed width". Discrete Appl. Math 12: 81–87. doi:10.1016/0166-218x(85)90042-3. MR 0798013. 
• Thurston, W. P. (1990), "Conway's tiling groups", American Mathematical Monthly (Mathematical Association of America) 97 (8): 757–773, doi:10.2307/2324578, JSTOR 2324578 .
• Wells, David (1997), The Penguin Dictionary of Curious and Interesting Numbers (revised ed.), London: Penguin, p. 182, ISBN 0-14-026149-4 .

Tessellation & tiling   Periodic Pythagorean Rhombille Schwarz triangle Rectangle Domino Uniform tiling & tessellation Coloring Convex Kisrhombille Wallpaper group Wythoff   Aperiodic Ammann–Beenker Aperiodic set of prototiles List Einstein problem Socolar–Taylor Gilbert Penrose Pentagon Pinwheel Quaquaversal Rep-tile & Self-tiling Sphinx Truchet   Other Anisohedral & Isohedral Architectonic & catoptric Circle Limit III Computer graphics Honeycomb Isotoxal 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