An algorithm for counting domino tilings of a rectangular chessboard

DOI10.13069/JACODESMATH.V13I1.335MaRDI QIDQ6840626zbMATH OpenFDO

Authors Abdulkarim M. Magomedov, Serge A. Lawrence

Publication date 23 March 2026

Published in Journal of Algebra, Combinatorics, Discrete Structures and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.13069/JACODESMATH.V13I1.335

zbMATH Keywords

algorithmdimer problemdomino tilingFibonacci numbersrecurrence relationtiling counting

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Cites work

• Combinatorial methods
• Dimer problem in statistical mechanics-an exact result
• Domino tilings of rectangles with fixed width
• scientific article; zbMATH DE number 5840376 (Why is no real title available?)
• scientific article; zbMATH DE number 3664976 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 6957158 (Why is no real title available?)
• Matching theory
• Mathematics via problems. Part 1. Algebra. Translated from the Russian by Paul Zeitz and Sergei G. Shubin
• Paving the chessboard
• The complexity of computing the permanent
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice

This page was built for publication: An algorithm for counting domino tilings of a rectangular chessboard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6840626)