Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes (Q1378522)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes |
scientific article |
Statements
Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes (English)
0 references
15 February 1998
0 references
Summary: 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\). The proof lends itself naturally to some interesting generalizations, and leads to a number of new conjectures.
0 references
domino tilings
0 references
square grid
0 references