On dimer coverings of rectangles of fixed width
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.
- A note on the occupational degeneracy for dimers on a saturated two- dimensional lattice space
- Combinatorial reciprocity theorems
- Dimer problem in statistical mechanics-an exact result
- Domino tilings of rectangles with fixed width
- scientific article; zbMATH DE number 3655943 (Why is no real title available?)
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- Paving the chessboard
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- The number of tilings of a block with blocks
- Remark on the dimer problem
- Paving of rectangles with stones of type \(1\times j\)
- Strip tiling and regular grammars
- Singular polynomials of generalized Kasteleyn matrices
- Resonance in elemental benzenoids
- Monomer-dimer tatami tilings of square regions
- Tiling-based models of perimeter and area
- Counting fixed-height tatami tilings
- On the number of tilings of the rectangular board with T-tetrominoes
- Statistics of domino tilings on a rectangular board
- Generating functions for straight polyomino tilings of narrow rectangles
- The Jones polynomials of three-bridge knots via Chebyshev knots and billiard table diagrams
- The proof of the Perepechko’s conjecture concerning near-perfect matchings on Cm x Pn cylinders of odd order
- Mutually-recursive formulas for enumerating partitions of the rectangle
- Generating functions for domino matchings in the \(2 \times k\) game of memory
- Close-packed dimers on nonorientable surfaces
- Counting domino tilings of rectangles via resultants
- The number of ribbon tilings for strips
- Bounded Dyck paths, bounded alternating sequences, orthogonal polynomials, and reciprocity
- Weak minimization of DFA -- an algorithm and applications
- Grid graphs, Gorenstein polytopes, and domino stackings
- Combinatorial analysis of tetris-like games
This page was built for publication: On dimer coverings of rectangles of fixed width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1821789)
