The classical cosine formula for enumerating domino tilings of a rectangle, due to Kasteleyn, Temperley, and Fisher, is proved once again, here using a combination of standard tools from combinatorics and algebra.
Domino tilings of rectangles with fixed width
β Scribed by David Klarner; Jordan Pollack
- Publisher
- Elsevier Science
- Year
- 1980
- Tongue
- English
- Weight
- 761 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
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 method is given for finding this di Terence equation together with the initial terms of the sequence. This gives rise to a new way to compute t(k, n) which differs completely with the known Pfaffian method. The generating fr nction of r, is a rational function Fk, and Fk is given explicitly for k = 1,. . . ,8. We end w+_i r ,ome conjectures concerning the form of Fk based on our computations.
π SIMILAR VOLUMES
We consider the problem of tiling with dominoes pictures of the plane. in theoretical and algorithmic aspects. For generalities and other tiling problems, see for example Refs. Beauquier et al. (1995), Conway and Lagarias (1990). Kannan and Soroker (1992), Kenyon (1992), and Beauquier (1991). The pi
We compute the number of rhombus tilings of a hexagon with sides a, b, c, a, b, c with three fixed tiles touching the border. The particular case a=b=c solves a problem posed by Propp. Our result can also be viewed as the enumeration of plane partitions having a rows and b columns, with largest entr