Domino shuffling for the Del Pezzo 3 lattice
Abstract
We present a version of the domino shuffling algorithm (due to Elkies, Kuperberg, Larsen and Propp) which works on a different lattice: the hexagonal lattice superimposed on its dual graph. We use our algorithm to count perfect matchings on a family of finite subgraphs of this lattice whose boundary conditions are compatible with our algorithm. In particular, we re-prove an enumerative theorem of Ciucu, as well as finding a related family of subgraphs which have 2^{(n+1)^2} perfect matchings. We also give three-variable generating functions for perfect matchings on both families of graphs, which encode certain statistics on the height functions of these graphs.
Keywords
Cite
@article{arxiv.1011.0045,
title = {Domino shuffling for the Del Pezzo 3 lattice},
author = {Cyndie Cottrell and Benjamin Young},
journal= {arXiv preprint arXiv:1011.0045},
year = {2011}
}
Comments
19 pages, 17 figures. V2: Changes to introduction and conclusion; references updated. V3: Correction to the statement of Theorem 7 and reworking of its proof