Combinatorial Approaches and Conjectures for 2-Divisibility Problems Concerning Domino Tilings of Polyominoes
Year: 1997
Type: article
Abstract: We give the first complete combinatorial proof of the fact that the number of domino tilings of the $2n \times 2n$ square grid is of the form $2^n(2k+1)^2$, thus settling a question raised by John, Sachs, and Zernitz. The proof lends itself naturally to some interesting generalizations, and leads to a number of new conjectures.
DOI: 10.37236/1314
Author: Lior Pachter
Institution: Massachusetts Institute of Technology
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2095754669