Auspicious tatami mat arrangements
Mathematics Subject Classification: 05B45,05A19
An auspicious tatami mat arrangement is a tiling of a rectilinear region with two types of tiles, tiles (dimers) and tiles (monomers). The tiles must cover the region and satisfy the constraint that no four corners of the tiles meet; such tilings are called tatami tilings. The main focus of this paper is when the rectilinear region is a rectangle. We provide a structural characterization of rectangular tatami tilings and use it to prove that the tiling is completely determined by the tiles that are on its border. We prove that the number of tatami tilings of an square with monomers is . We also show that, for fixed-height, the generating function for the number of tatami tilings of a rectangle is a rational function, and outline an algorithm that produces the generating function.
Keywords: tatami, monomer-dimer tiling, rational generating function
1 What is a tatami tiling?
Traditionally, a tatami mat is made from a rice straw core, with a covering of woven soft rush straw. Originally intended for nobility in Japan, they are now available in mass-market stores. The typical tatami mat occurs in a aspect ratio and various configurations of them are used to cover floors in houses and temples. By parity considerations it may be necessary to introduce mats with a aspect ratio in order to cover the floor of a room. Such a covering is said to be “auspicious” if no four corners of mats meet at a point. Hereafter, we only consider auspicious arrangements, since without this constraint the problem is the classical and well-studied dimer tiling problem (, ). Following Knuth (), we will call the auspicious tatami arrangements, tatami tilings. The fixed-height enumeration of tatami tilings that use only dimers (no monomers) was considered in , and results for the single monomer case were given in .
Perhaps the most commonly occurring instance of tatami tilings is in paving stone layouts of driveways and sidewalks, where the most frequently used paver has a rectangular shape with a aspect ratio. Two of the most common patterns, the “herringbone” and the “running bond,” shown in Figure 1, have the tatami property. Consider a driveway of the shape in Figure 2. How can it be tatami tiled with the least possible number of monomers? The answer to this question could be interesting both because of aesthetic appeal, and because it could save work, since to make a monomer a worker typically cuts a paver in half.
Before attempting to study tatami tilings in general orthogonal regions it is crucial to understand them in rectangles, and our results are primarily about tatami tilings of rectangles.
In Section 2 we determine the structure of tatami tilings in a rectangle. Our structural characterization has important algorithmic implications, for example, it reduces the size of the description of a tiling from to and may be used to generate tilings quickly. The three theorems in Section 3 are the main results of the paper and are also stated here. The first of these concerns the maximum possible number of monomers. Let be the number of tilings of the grid, with monomers (and the other tiles being horizontal or vertical dimers).
If , then has the same parity as and .
Following this we prove a counting result for maximum-monomer tilings of square grids.
The number of tilings with monomers, .
Our final result concerns fixed-height tilings with an unrestricted number of monomers.
For a fixed number of rows , the ordinary generating function of the number of tilings of an rectangle is a rational function.
We also provide an algorithm which outputs this generating function for a given and explicitly give the generating function for and , along with the coefficients of the denominator for . In Section 4 we return to the question of tatami tiling general orthogonal regions and introduce the “magnetic water strider problem” along with additional conjectures and open problems.
2 The structure of tatami tilings: -diagrams
We show that all tatami tilings have an underlying structure which partitions the grid into regions, where each region is filled with either the vertical or horizontal running bond pattern (or is a monomer not touching the boundary). For example, in Figure 3 there are 11 regions, including the interior monomer. We will describe this structure precisely and prove some results for tilings of rectangular grids.
Wherever a horizontal and vertical dimer share an edge , either the placement of another dimer is forced to preserve the tatami condition, or the tiles make a with the boundary of the grid . In the former case, the placement of the new dimer again causes the sharing of an edge , and so on , until the boundary is reached.
The successive placement of dimers, described above gives rise to skinny herringbone formations, which we call rays. They propagate from their source to the boundary of the grid and cannot intersect one another. Between the rays, there are only vertical or horizontal running bond patterns. The intersection of a running bond with the boundary is called a segment. This segment is said to be jagged if it consists of alternating monomers and dimers orthogonal to the boundary; otherwise it is said to be smooth because it consists of dimers that are aligned with the boundary. Every jagged segment is marked with square brackets in Figure 3.
We know that a ray, once it starts, propagates to the boundary. But how do they start? In a rectangular grid, we will show that a ray starts at one of four possible types of sources. In our discussion we use inline diagrams to depict the tiles that can cover the grid squares at the start of a ray. We need not consider the case where the innermost square (denoted by the circle) is covered by a vertical dimer because this would move the start of the ray.
If it is covered by a horizontal dimer , the source, which consists of the two dimers that share a long edge, is called a bimer. Otherwise it is covered by a monomer in which case we consider the grid square beside it . If it is covered by a monomer the source is called a vee ; if it is covered by a vertical dimer the source is called a vortex ; if it is covered by a horizontal dimer it is called a loner . Each of these four types of sources forces at least one ray in the tiling and all rays begin at either a bidimer, vee, vortex or loner. The different types of features are depicted in Figures 4-6.
The coloured tiles in Figures 4-6 characterize the four types of sources. A bidimer or vortex may appear anywhere in a tiling, as long as the coloured tiles are within its boundaries. The vees and loners, on the other hand, must appear along a boundary, as shown in Figure 4.
The collection of bold staircase-shaped curves in each of the four types of source-ray drawings in Figures 4-6, is called a feature. These features do not intersect when drawn on a tatami tiling because rays cannot intersect. A feature-diagram refers to a set of non-intersecting features drawn in a grid. Not every feature-diagram admits a tatami tiling; those that do are called -diagrams. See Figure 7.
Recall that a tatami tiling consists of regions of horizontal and vertical running bond patterns. A feature-diagram is a -diagram if and only if each pair of rays bounding the same region admit bond patterns of the same orientation and the distance between them has the correct parity. The precise conditions are stated in Lemma 1.
Features decompose into four types of rays, to which we assign the symbols , , , and , indicating the direction of propagation. Two rays are said to be adjacent if they can be connected by a horizontal or vertical line segment which intersects no other ray. If is an adjacent pair, then is on the left when considering horizontally adjacent pairs and on the bottom when considering vertically adjacent pairs.
A feature diagram is a -diagram if and only if the following four conditions hold.
There are no vertical -adjacencies, nor are there any vertical -adjacencies, where and are either or ;
all distances are even, except for vertical
-distances and vertical -distances, which are odd.
This characterization has some implications for the space and time complexity of a tiling.
Let be an grid, with .
The storage requirement for a tatami tiling of is ; that is, a tatami tiling can be recovered from integers, each of size at most .
A tatami tiling of is uniquely determined by the tiles on its boundary.
Whether a feature diagram in is a -diagram can be determined in time .
To prove (i), notice that a non-trivial -diagram defines a tiling uniquely. In the trivial case there are no features and exactly four possible running bond configurations, two horizontal and two vertical. Otherwise, each feature can be stored as a pair of coordinates and a type. It is not possible to have more than compatible features in a -diagram in , so at most integers of size at most are needed, proving (i).
To prove (ii), we need to show that we can recover the -diagram from the tiles that touch the boundary. Those portions of the -diagram corresponding to vees and loners, as well as bidimers whose source tiles are both on the boundary , are easy to recover. The black rays in Figure 10 show their recovery. Imagine filling in the remaining red rays, whose ends look like , by following them naïvely, backwards from their endings to the boundary. The ends of the four rays emanating from a bidimer or vortex will always form exactly one of the four patterns illustrated in Figure 11; in each case, it is straightforward to recover the position and type of source. This proves (ii).
Claim (iii) is true provided that Lemma 1 only needs to be applied to ray-adjacencies. Notice that a pair of rays can be adjacent and yet not be adjacent on the boundary. For example, it happens in Figure 7.
Each ray bounds exactly two regions, each of which is bounded by at most three other rays, and two rays must bound the same region to be adjacent. Thus, a ray is adjacent to at most six other rays. Let the ray-adjacencies be the edges of a graph whose vertex set is the set of rays, so that has maximum degree at most . Therefore, the number of ray-adjacencies, , and hence applications of Lemma 1, is linear in the number of rays, , which is at most four times the number of features, which is in . This proves (iii). ∎
The -diagram structure is a useful tool for enumerating and generating tatami tilings as will be illustrated in the following sections.
3 Counting results
Let be the number of tatami tilings of a rectangular grid with rows, columns, and monomers. Also, will denote the sum
We begin by giving necessary conditions for to be non-zero.
If , then has the same parity as and .
Let and be such that and let be the number of grid squares covered by dimers in an tatami tiling so that . Since is even, must have the same parity as .
It suffices to assume that , and prove that . The proof proceeds in two steps. First, we will show that a monomer on a vertical boundary of any tiling can be mapped to the top or bottom, without altering the position of any other monomer. Then we can restrict our attention to tilings where all monomers appear on the top or bottom boundaries, or in the interior. Secondly, we will show that there can be at most monomers on the combined horizontal boundaries.
Let be a tatami tiling of the grid with a monomer on the left boundary, touching neither the bottom nor the top boundary. The monomer is (a) part of a vee or a loner, or (b) is on a jagged segment of a region of horizontal bond. Define a diagonal to be together with a set of dimers in this region which form a stairway shape from to either the top or bottom of the grid as shown in purple in Figure (a)a. If such a diagonal exists, a diagonal flip can be applied, which changes the orientation of its dimers and maps to the other end of the diagonal. In case (a) a diagonal clearly exists since it is a source and its ray will hit a horizontal boundary because .
If is on a jagged segment, then we argue by contradiction. Suppose neither diagonal exists, then they must each be impeded by a distinct ray. Such rays have this horizontal region to the left so the upper one is directed and the lower and they meet the right boundary (before intersecting). Referring to Figure (c)c,
where is some odd number. Thus implying that . On the other hand,
implies that , which is a contradiction. Therefore at least one of the diagonals exists and the monomer can be mapped to a horizontal boundary.
We may now assume that there are no monomers strictly on the vertical boundaries of the tiling, and therefore all monomers are either in the top or bottom rows or in vortices. Let be the number of vortices. Encode the bottom and top rows of the tiling by length binary sequences and , respectively. In the sequences, s represent monomers and s represent squares in dimers.
If contains a consecutive pair of s, this represents a vee in the top row; the vee has a region of horizontal dimers directly below it. This region of horizontal bond must reach the bottom row somewhere, otherwise, by an argument similar to one given previously, we would have (see Figure (a)a). Therefore, there must be a consecutive pair or s in unique to these s in . Modify so that the becomes a , and modify so that the becomes . Do this for each consecutive pair of s in and , as illustrated in Figure (b)b. The updated and sequences contain no consecutive pairs of s, but the total number of s remains unchanged.
Now we show that for each of the vortices, a can be removed from each of and and there will still be no consecutive pairs of s in the new sequences. Each vortex generates 4 rays; at least one of these rays will hit the top boundary, and at least one will hit the bottom boundary. In fact, a horizontal and a vertical dimer on either side of the ray will lie on the upper boundary, and similarly for the bottom boundary. Figure (a)a is helpful in seeing why this is true. These dimers on either side of the ray induce a in and another in . (Although not used in this proof, note that the comments above also apply to bidimers.) In total, there are at least distinct triples of s in each sequence, one for each vortex. Now remove from each triple as in Figure (b)b. The updated and sequences have a combined length of and neither of them contains a . Thus the total number of s is at most , which is at most . Adding back the vortex monomers, we conclude that there are at most monomers in total, which finishes the proof.
Note that, to acheive the bound of , we must have , and that the maximum is achieved by a vertical bond pattern. ∎
The following three statements are true for tatami tilings of an grid with .
The maximum number of monomers in a grid is if is even and is odd; otherwise it is . There is a tatami tiling achieving this maximum.
A tatami tiling with the maximum number of monomers has no vortices.
A tatami tiling with the maximum number of monomers has no bidimers.
(i) That this is the correct maximum value can be inferred from Theorem 1. A tiling consisting only of vertical running bond achieves it, for example.
(ii) This was noted at the end of the proof of Theorem 1.
(iii) We can again use the same sort of reasoning that was used for vortices in Theorem 1, but there is no need to “add back” the monomers, since bidimers do not contain one. ∎
3.1 Square tatami tilings
In this section, we show that . Theorem 2 relies on the following lemma and corollary.
For each tiling with monomers, a trivial tiling can be obtained via a finite sequence of diagonal flips in which each monomer moves at most once. Reversing this sequence returns us to the original tiling.
Let be the -diagram of an tiling with monomers. Each ray in touches two adjacent boundaries which form a corner , so and are said to belong to each other. For each corner , choose the ray which belongs to it and is farthest away from it; if a corner does not have a ray, then choose the corner itself. Between the four chosen rays/corners, our tiling can only contain either horizontal or vertical running bond (by Lemma 1). Let be the area of this central running bond.
We begin a sequence of diagonal flips by choosing one ray that is farthest from its corner and flipping the diagonal touching that is between and its corner. Let be the resulting -diagram. In , is not part of the central running bond and in , it is; thus . Continuing this process yields a trivial tiling via a finite sequence of diagonal flips.
Every tiling with monomers has two corner monomers and they are in adjacent corners.
The sequence of diagonals chosen for diagonal flips described in Lemma 3 never includes a diagonal containing a corner monomer because such a diagonal is never between a ray and its associated corner. As such, the corner monomers are fixed throughout the sequence of diagonal flips yielding a trivial tiling. Since a trivial tiling with monomers has two monomers in adjacent corners, then, so must every other tiling with monomers. ∎
Corollary 2 show that the four rotations of any tiling with monomers are distinct. We call the rotation with monomers in the top two corners the canonical case.
The number of tilings with monomers, , is .
We count the tilings with monomers up to rotational symmetry by counting the canonical cases only. Let . We will give a combinatorial proof that satisfies the following recurrence:
In Theorem 1 we defined a diagonal flip which results in a monomer moving up or down depending on the orientation of its diagonal. As such, we simplify our terminology by referring to flipping a monomer in a particular direction (up, down, left, or right).
We treat the even and odd cases separately, though the proofs are naturally similar. In both cases, we begin with the canonical trivial case and consider all possible sequences of flips in which each monomer is moved at most once and the corner monomers are fixed. By Lemma 3 and its corollary, this counts the canonical tilings.
The canonical trivial case for even , shown in Figure (a)a for , is a horizontal running bond tiling with fixed (black) monomers in the top corners and (red and yellow) monomers on both the left and right boundaries. We classify the tilings according to what happens to the bottom (yellow) monomer on each of these boundaries, which we will call and .
First, suppose is flipped up as shown in Figure (b)b. Because our tiling is square, this flip inhibits any orthogonal diagonal flips and thus the monomers that shared a boundary with before it was flipped up can only be flipped up and monomers on the opposite boundary can only be flipped down. There are such monomers that are not fixed and can be flipped independently of each other. This gives possibilities when either or is flipped up, resulting in a total of tilings.
If neither nor is flipped up, these monomers can be flipped (or not) independently of each other and of other non-fixed monomers, as shown in Figure 16. As such, we can now ignore what happens to and and consider them fixed, keeping in mind that for each such tiling, there are three others with and in different positions. We will find a one-to-one correspondence between these tilings and one quarter of the tilings with monomers by mapping the monomers of the canonical trivial cases (rotated by 180 degrees in the smaller case) and showing that any sequence of flips in one case can be applied to the equivalent monomers in the other.
There are (red) monomers on the left and right boundaries of the canonical case that we have not fixed. Consider the 180 degree rotation of the canonical trivial case for tilings with monomers which has fixed (black) monomers in the bottom corners, as shown in Figure (c)c for . Associate the non-fixed (red) monomers of this tiling with the non-fixed (red) monomers of the canonical trivial case in a natural way: pairing those in the same position relative to the bottom fixed monomers. Similarly, diagonals containing associated monomers are also associated.
We need to show that compatibility between diagonal flips is preserved between the smaller and larger cases: that is, if two diagonals cannot both be flipped in the larger square, the same is true for the corresponding diagonals in the smaller square, and vice versa.
In both cases, two monomers on the same boundary can both be flipped if and only if they are either flipped in the same direction or the top one is flipped up and the bottom one is flipped down; compatibility is preserved.
For a pair of monomers on opposite boundaries, observe that a conflict between flips can only occur if we try to flip them both in the same direction. Further, conflict depends entirely on the distance of the monomers from the horizontal centerline of the grid. Let and respectively be the distances from the horizontal centerline, with negative values below the line and positive values above. If , then the two monomers cannot both be flipped down, and similarly, if , they cannot both be flipped up. This distance is preserved between the associated monomers in the larger and smaller squares and thus compatibility is also preserved.
There are ways of flipping the monomers of the (rotated) canonical trivial case, and thus ways of flipping the corresponding monomers of the canonical trivial case. This yields tilings, one for each way of positioning and and establishes (1) for even .
The canonical trivial case for odd , shown in Figure (a)a for , is a vertical running bond tiling with (black) monomers in the top corners. It has monomers on the top boundary and monomers on the bottom boundary. Label the bottom left and bottom right monomers and respectively.
Similar to the even case, if either is flipped right (as in Figure (b)b) or is flipped left, there are monomers which can be flipped independently to obtain other tilings and this yields tilings.
Otherwise, and can be flipped left and right (respectively) independently of each other and of other monomers, as shown in Figure 18. Again we fix and , keeping in mind that for each such tiling, there are three others with and in different positions. We will find a similar one-to-one correspondence to the one in the even case.
There are (red) monomers on the top and bottom boundaries of the canonical trivial case that we have not fixed. Once again, we associate these monomers with those of the 180 degree rotation of the canonical trivial case with monomers which has fixed (black) monomers in the bottom corners. Arguing as in the even case, with a vertical centerline rather than a horizontal one, we conclude that a pair of monomers in the tiling can be flipped if and only if the corresponding flips can be made in the tiling. Again this yields tilings and establishes (1) for odd . ∎
3.2 Fixed height tatami tilings
In this section we show that for a fixed number of rows , the ordinary generating function of the number of tilings of an rectangle is a rational function. We will show that, for each value of , the number of fixed-height tilings satisfies a system of linear recurrences with constant coefficients. We will derive the recurrences for small values of and then discuss an algorithm which can be used for larger values of .
Let denote the generating function
For , a tatami tiling of a rectangle begins with either a monomer or a dimer. Thus, for , where and . This is the well known Fibonnaci recurrence. Since it is a linear recurrence with constant coefficients, it is not a difficult task to verify that
For each we derive a recurrence based on partial tilings which can be solved using mathematical software such as Maple. A partial tiling of an grid is a minimal tiling if and only if the first columns are covered and no tile lies entirely outside of these columns. The and may sometimes be omitted. Let be the set of configurations which correspond to a minimal tiling. For , let be a ternary -tuple whose elements correspond to the grid squares of the first column, ordered from top to bottom. The elements , and , each represent a grid square covered by a vertical dimer, monomer, or horizontal dimer, respectively. Note that s always appear in consecutive pairs. For example, corresponds to the minimal tiling shown in Figure (a)a.
For , let be the number of tilings of an rectangle that begin with the minimal tiling . Note that if does not contain a 2, and is zero otherwise. To derive a recurrence we determine all ways of extending each configuration in to a minimal tiling. By taking each of these minimal tilings and chopping off the first column we can match these tilings to an element in which will define a recurrence. Figure (b)b shows an extension of the tiling and Figure (c)c shows that this extension corresponds to the configuration . Notice that Figure (c)c can only be extended once more.
For , we have . Since contains all possible ways to start a tiling of an rectangle, with , it follows that
The initial conditions are , and . To derive the recurrence we consider the ways of extending each of the minimal tilings in to a minimal tiling.
By solving the system of recurrences defined by these five cases and Equation (2) we arrive at the stated result for . ∎
The process outlined in the proof of Lemma 4 can be implemented in an algorithm. We determine the set with an exhaustive search. Then, for each element , we list all extensions to a minimal tiling. Each extension of produces a unique sum-term in the recurrence for . Once again, the initial conditions are
We may reduce the number of equations in the system of recurrences by ignoring elements of which cannot be extended to a minimal tiling. This may be taken further by determining necessary conditions for an element of to be extendible to an tiling.
The algorithm produces a system of linear recurrences with constant coefficients. This proves the following result.
For a fixed number of rows , the ordinary generating function for the number of tilings of an rectangle is a rational generating function.
The output of our algorithm for gives the following generating function:
It is impractical to include the complete generating function for any larger values of r. The degrees for the numerators and denominators, however, as well as the coefficients in the denominators are given in Table 1 for . The salient patterns in these coefficients are summarized in Conjectures 1 and 2. Note that Conjecture 1 implies is a self-reciprocal polynomial for .
Let , where and are relatively prime polynomials, and , and . Then,
A mod pattern also seems to occur in the degrees of the denominators of . The rigid structure we encounter in tatami tilings prompts us to infer this pattern upon all values as well.
Let be the denominator of . Then,
|Coefficients of ordered from left to right by ascending degree and then folded like these arrows; for , and for .|
|3||4||1, -2, 0, -2, 1|
|1, -1, -2, 0, -2, 1, 1|
|-1, 1, 1, 1,-1, 7 1,-1,-1,-1, 1,-7|
|-1, 1, 1,-1, 3,-1, 5,-2 1, 1,-1,-1,-3,-1,-5|
|1,-1,-1, 1,-1,-2, 2,-10, 9,-1, 4, 6 1,-1,-1, 1,-1,-2, 2,-10, 9,-1, 4|
|1,-1,-3, 3, 4,-4,-9, 7, 6,-5, 2, 0 1, 1,-3,-3, 4, 4,-9,-7, 6, 5, 2|
|-1, 1, 1,-1, 1,-1, 1, 3,-3, 13,-12 1,-1,-1, 1,-1, 1,-1,-3, 3,-13, 12 34,-2, 6, 20,-6, 12, 0, 0 -34, 2,-6,-20, 6,-12, 0, 0|
|-1, 1, 1,-1, 1,-1, 1,-1, 5,-3, 11,-8 1, 1,-1,-1,-1,-1,-1,-1,-5,-3,-11,-8 10, 24, 2, 28, 2, 20, 8, 14, 4, 6 -24, 2,-28, 2,-20, 8,-14, 4,-6|
|1,-1,-1, 1,-1, 1,-1, 1,-1,-4, 4,-16, 15, 1,-1 1,-1,-1, 1,-1, 1,-1, 1,-1,-4, 4,-16, 15, 1,-1 -120, 68,-78,-18, 18,-66, 66,-2, 7, 41,-23, 33,-17, 17 68,-78,-18, 18,-66, 66,-2, 7, 41,-23, 33,-17, 17|
|1,-1,-5, 5, 13,-13,-27, 27, 48,-48,-83, 81, 125,-120,-160 1, 1,-5,-5, 13, 13,-27,-27, 48, 48,-83,-81, 125, 120,-160 -34, 83, 89,-156,-165, 199, 210,-202,-206, 185, 193,-154 -34,-83, 89, 156,-165,-199, 210, 202,-206,-185, 193, 154|
4 More conjectures and further research
The -diagram structure removes much of the mystery from tatami tilings and motivates considerable future work. In this section we list some open problems and conjectures, beginning with another counting problem on rectangular grids.
4.1 Rectangular regions
For all and there is an such that, for all .
whenever has the same parity as (otherwise , by Theorem 1).
Experimentally, it appears that the smallest is , if .
The easiest case occurs when and . It is not hard to show that for all odd we have (the single monomer must go at a corner or in the center).
In a subsequent paper we will show that for ,
whenever and have the same parity.
Returning to the subject of generating functions, ignoring signs, it appears that the denominators of in Section 3.2 are self-reciprocal. There must be a combinatorial explanation for this. Similar questions in the non-tatami case are considered in .
Generating functions also appear in Conjecture 4, inspired by conversations with Knuth. Let be the generating polynomial for the number of tilings with monomers and vertical dimers. Once again, to count such tilings we consider flipping diagonals, with the added precaution that the sum of the number of tiles in the flipped diagonals is a given constant. The relationship between this and subsets of which have a given sum is detailed in a subsequent publication.
Let denote the th cyclotomic polynomial. Recall that the roots of are the primitive roots of unity. One of their more well-known properties is that
Let denote the ordinary generating function of subsets of
which have a given sum. That is, is the number of subsets of
such that the sum of the numbers in is . It is not difficult to see that
Let denote the number of 2s in the prime factorization of and note that
When this latter expression is used in some interesting simplification occurs.
For all ,
The generating polynomial has the factorization
where is an irreducible polynomial.
We return to the topic mentioned in the introduction: Tatami-tilings of orthogonal regions.
4.2 Orthogonal regions
We believe that the main structural components are the same as they were for rectangles, but there are a few subtleties to be clarified at inside corners, since a ray could begin at such a place.
What is the computational complexity of determining the least number of monomers that can be used to tile an orthogonal region given the segments that form the boundary of the region and the unit size of each dimer/monomer? In the rectangular grid this is answerable in polynomial time using -diagrams, however, it appears to be NP-hard for an arbitrary number of segments.
The problem of minimizing the number of monomers in a tiling inspires what we call the “magnetic water strider problem”. This time the orthogonal region is a pond populated by water striders. A water strider is an insect that rides atop water in ponds by using surface tension. Its 4 longest legs jut out at 45 degrees from its body. In the fancifully named magnetic water strider problem, we require the body to be aligned north-south. Furthermore its legs support it, not by resting on the water, but by extending to the boundary of the pond. Naturally, the legs of the striders are not allowed to intersect. A legal configuration of magnetic water striders in an orthogonal pond is shown Figure (b)b.
There are two problems and a game here. The first is a packing problem: What is the largest number of magnetic waters striders that a pond can support? On the other hand, one can ask what is the minimum number that can be placed so that no more can be added. Placing and packing striders can be tricky, which gives rise to an adversarial game where players take turns placing striders in an orthogonal region. Brian Wyvill has kindly implemented a version of this game, available at http://www.theory.cs.uvic.ca/~cos/tatami/.
Interpreted as a matching problem on a subgraph of a grid graph , a tatami tiling is a matching with the property that contains no 4-cycles. Note that there is always such a matching (e.g., take the “running bond” layout on the infinite grid graph and then restrict it to ). However, if we insist on a perfect matching, then the problem is equivalent to our “perfect” driveway paving problem from the introduction.
More generally, a matching whose removal destroys -cycles is called -transverse. Ross Churchley proved that finding a -transverse matching in an arbitrary graph is NP-hard when (private communication ).
4.3 Combinatorial games
Consider the following game. Given an orthogonal region, players take turns placing dimers (or dimers and monomers); each placement must satisfy the tatami constraint and the last player who can move wins. This game, called Oku!, is reminiscent of the game called Nimm, in which players also win by making the last move, however a winning strategy for our game is unknown and there are grid sizes in which the second player can force a win. The name is a phonetic spelling of the Japanese word for “put”.
Another game applies tomography to rectangular tilings.
Tiling tomography is a rich and open area of complexity theory to which a good introduction can be found in . The relevant question is as follows: Given triples of numbers , one for each row and one for each column, is there a tatami tiling which has horizontal dimers, vertical dimers, and monomers in the respective row or column?
Without the tatami condition this decision problem is NP-hard (Theorem 4, ). Hard or not, the tatami condition gives considerable information in practice, however, making the reconstruction of a tatami tiling an entertaining challenge. Erickson, A., has created an online computer game out of this called Tomoku. It is playable at http://tomokupuzzle.com, complete with music, countdown timers and high scores.
Both of these games are at http://www.theory.cs.uvic.ca/~cos/tatami/, and it should be noted that they can also be played with a pencil and paper.
Thanks to Donald Knuth for his comments on an earlier draft of this paper and to Martin Matamala for pointing out the tomography problem.
-  Alhazov, A., Morita, K., Iwamoto, C.: A Note on Tatami Tilings. Mathematical Foundation of Algorithms and Computer Science (T. Tokuyama, Ed.), RIMS Kôkyûroku series, No. 1691, Research Institute for Mathematical Sciences, Kyoto, Japan, (2010), 1–7. http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/kokyuroku.html
-  Anzalone, N., Baldwin, J., Bronshtein, I., Petersen, T.K.: A reciprocity theorem for monomer-dimer coverings. In Morvan, M., Rémila, É., eds.: Discrete Models for Complex Systems, DMCS’03. Volume AB of DMTCS Proceedings., Discrete Mathematics and Theoretical Computer Science (2003) 179–194
-  Chrobak, M., Couperus, P., Dürr, C., Woeginger, G.: On tiling under tomographic constraints Theoretical Computer Science Vol: 290 Issue: 3 ISSN: 0304-3975 Date: 01/2003 Pages: 2125 - 2136
-  Churchley, R., Huang, J.: Private communication, November 2010
-  Dürr, C., Guiñez, F., Matamala, M.: Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard. Algorithms - ESA 2009 LNCS 5757 (2009) 776–787
-  Kenyon, R., Okounkov, A.: “What is a dimer?”. Notices of the American Mathematical Society 52 (2005) 342–343
-  Knuth, D. E.: The Art of Computer Programming. Volume 4, fascicle 1B. Addison-Wesley (2009)
-  Pachter, L.: Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes. Electronic Journal of Combinatorics 4 (1997) 2–9
-  Ruskey, F., Woodcock, J.: Counting fixed-height tatami tilings. Electronic Journal of Combinatorics 16 (2009) 20
-  Stanley, R. P.: On dimer coverings of rectangles of fixed width. Discrete Applied Mathematics 12(1) (1985) 81 – 87