Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes
The electronic journal of combinatorics, Tome 4 (1997) no. 1
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl EuDML
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.
Lior Pachter. Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes. The electronic journal of combinatorics, Tome 4 (1997) no. 1. doi: 10.37236/1314
@article{10_37236_1314,
author = {Lior Pachter},
title = {Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes},
journal = {The electronic journal of combinatorics},
year = {1997},
volume = {4},
number = {1},
doi = {10.37236/1314},
zbl = {0886.05046},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1314/}
}
TY - JOUR AU - Lior Pachter TI - Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes JO - The electronic journal of combinatorics PY - 1997 VL - 4 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.37236/1314/ DO - 10.37236/1314 ID - 10_37236_1314 ER -
Cité par Sources :