Generalizing the divisibility property of rectangle domino tilings
The electronic journal of combinatorics, Tome 23 (2016) no. 3
We introduce a class of graphs called compound graphs, which are constructed out of copies of a planar bipartite base graph, and explore the number of perfect matchings of compound graphs. The main result is that the number of matchings of every compound graph is divisible by the number of matchings of its base graph. Our approach is to use Kasteleyn's theorem to prove a key lemma, from which the divisibility theorem follows combinatorially. This theorem is then applied to provide a proof of Problem 21 of Propp's Enumeration of Matchings, a divisibility property of rectangles. Finally, we present a new proof, in the same spirit, of Ciucu's factorization theorem.
DOI :
10.37236/4520
Classification :
05C70, 05C76, 05B45
Mots-clés : Kasteleyn theorem, Propp's enumeration of matchings, Ciucu's factorization theorem
Mots-clés : Kasteleyn theorem, Propp's enumeration of matchings, Ciucu's factorization theorem
Affiliations des auteurs :
Forest Tong  1
@article{10_37236_4520,
author = {Forest Tong},
title = {Generalizing the divisibility property of rectangle domino tilings},
journal = {The electronic journal of combinatorics},
year = {2016},
volume = {23},
number = {3},
doi = {10.37236/4520},
zbl = {1339.05326},
url = {http://geodesic.mathdoc.fr/articles/10.37236/4520/}
}
Forest Tong. Generalizing the divisibility property of rectangle domino tilings. The electronic journal of combinatorics, Tome 23 (2016) no. 3. doi: 10.37236/4520
Cité par Sources :