On dimer coverings of rectangles of fixed width (Q1821789): Difference between revisions

Let t(m,k) be the number of ways to tile a \(k\times m\) rectangle with mk/2 dominoes (1\(\times 2\) rectangles). Also, let \(T_ k(z)=\Sigma t(n,k)z^ n\) be the generating function for (t(n,k): \(n=0,1,...)\) for a fixed k. The author uses an explicit formula for t(n,k) found by \textit{P. W. Kasteleyn} [The statistics of dimers on a lattice, Physica 27, 1209- 1225 (1961)] and by \textit{H. N. V. Temperley} and \textit{M. E. Fisher} [The Dimer problem in statistical mechanics- an exact result, Phil. Mag., VIII. Ser. 6, 1061-1063 (1961; Zbl 0126.251)] to answer various questions about \(T_ k(z)\) posed by \textit{D. Klarner} and \textit{J. Pollack} [Domino tilings of rectangles with fixed width, Discrete Math. 32, 45-52 (1980; Zbl 0444.05009)] and still other questions posed by \textit{J. L. Hock} and \textit{R. B. McQuistan} [A note on the occupational degeneracy for dimers on a saturated two-dimensional lattice space, Discrete Appl. Math. 8, 101-104 (1984; Zbl 0536.05004)]. This paper nicely ties together the known results.