Existing research on Bone card coverage

Problem:

Count the ways to tile an MxN rectangle with 1x2 dominos.

Solve:

The number of ways to tile an MxN rectangle with 1x2 dominos is
2 ^ (M * N/2) times the product
{Cos ^ 2 (m * pi/(M + 1) + cos ^ 2 (n * pi/(N + 1)} ^ (1/4)
Over all m, n in the range 0 <m + 1, 0 <n <N + 1.

[Exercises:
0) Why does this work for M * N odd?
1) When M <3 the count can be determined directly;
Check that it agrees with the above formula.
2) Prove directly this formula gives an integer for all M, N, and further show that
If M = N it is a perfect square when 4 | N and twice a square otherwise.
]
Where does this come from? For starters note that, with the usual checker-
Board coloring, each domino must cover one light and one dark square. Assume
That M * N is even (but as it happens our formula will work also when both
M, N are odd --- see exercise 0 abve). Form a square matrix of size
M * N/2 whose rows and columns are indexed by the light and dark squares,
And whose (j, k) entry is 1 if the j-th light and k-th dark square are
Adjacent and zero otherwise. There are now three key ideas:
First, the number of tilings is the number of ways to match each light
Square with an adjacent dark square; thus it is the _ permanent _ of our
Matrix (recall that the permanent of a rxr matrix is a sum of the same
R! Terms that occur in its determinant, cannot without the usual + 1/-1
Sign factors ).
Second, that by modifying this matrix slightly we can convert
Permanent to a determinant; this is nice because determinants are generally
Much easier to evaluate than permanents. One way to do this is to replace
All the 1's that correspond to vertical adjacency to I's, and multiply
Whole thing by a suitable power of I (which will disappear when we raise
It to a fourth power ).

[Exercise 3: check that this transformation actually works as advertised!]

Third, that we can diagonalize the resulting matrix A --- or, more
Conveniently, the square matrix of A 'order M * N whose order-(M * N/2)
Blocks are 0, A; A-transpose, 0, whence det (A') = +-(det (A) ^ 2. Then
The rows and columns of A' are indexed by squares of either hue on our
Generalized checkerboard, and its entries are 1 for horizontally adjacent
Squares, I for vertically adjacent ones, and 0 for nonadjacent (including
Coincident) squares. This a' can be diagonalized by using the trigonometric
Basis of vectors v_ AB (a, B as in the formula abve) whose coordinate
The (m, n)-th square is sin (a * m * pi/(M + 1) * sin (B * n * pi/(N + 1 )).

Exercise 4: verify that these are in fact orthogonal eigenvectors of ',
Determine their eigenvalues, and complete the proof the above formula.


(None of this is new, but it does not seem to be well-known: indeed
Each of the above steps seems to have been discovered independently
Several times, and I'm not sure whom to credit with the first discovery
Of this special application of the method. For different approaches
To exactly solvable problems involving the enumeration of domino tilings,
See the two papers of G. Kuperberg, Larsen, Propp and myself on
"Alternating-Sign Matrices and Domino Tilings" in the first volume
The _ Journal of Algebraic Combinatorics _.)
-- Noam D. Elkies (elkies@zariski.harvard.edu)
Dept. of Mathematics, Harvard University
Http://www.faqs.org/faqs/puzzles/archive/geometry