Domino tilings of rectangles with fixed
โ
David Klarner; Jordan Pollack
๐
Article
๐
1980
๐
Elsevier Science
๐
English
โ 761 KB
Let t(k, n) denote the number of ways to tile a C x n rectangle with 1 x 2 rectangles (called dominoes). We show that for each fixed k the s( quence tk = (t(k, O), t(k, I), . . .) satisfies a difference equation (linear, homogeneous, and w ith constant coefficients). Furthermore, a computational met