Domino tilings of rectangles with fixed width

DOI10.1016/0012-365X(80)90098-9zbMath0444.05009WikidataQ29010957 ScholiaQ29010957MaRDI QIDQ1144573

David A. Klarner, Jordan B. Pollack

Publication date: 1980

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

domino tilingdifference equationdimer problem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Additive difference equations (39A10) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (13)

An effective algorithm for obtaining polynomials for dimer statistics. Application of operator technique on the topological index to two- and three-dimensional rectangular and torus lattices ⋮ Grid graphs, Gorenstein polytopes, and domino stackings ⋮ The matching polynomial of a polygraph ⋮ The Jones polynomials of three-bridge knots via Chebyshev knots and billiard table diagrams ⋮ The number of tilings of a block with blocks ⋮ The number of ribbon tilings for strips ⋮ Generating functions for straight polyomino tilings of narrow rectangles ⋮ Combinatorial analysis of tetris-like games ⋮ MUTUALLY-RECURSIVE FORMULAS FOR ENUMERATING PARTITIONS OF THE RECTANGLE ⋮ Equivalence between Clar covering polynomials of single zigzag chains and tiling polynomials of \(2 \times n\) rectangles ⋮ Weak minimization of DFA -- an algorithm and applications ⋮ On dimer coverings of rectangles of fixed width ⋮ Strip tiling and regular grammars

Cites Work

• Some Remarks on the Cayley-Hamilton Theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Domino tilings of rectangles with fixed width