On the number of fully packed loop configurations with a fixed associated matching
Combinatorics
2007-05-23 v2 Mathematical Physics
math.MP
Abstract
We show that the number of fully packed loop configurations corresponding to a matching with nested arches is polynomial in if is large enough, thus essentially proving two conjectures by Zuber [Electronic J. Combin. 11 (2004), Article #R13].
Cite
@article{arxiv.math/0502392,
title = {On the number of fully packed loop configurations with a fixed associated matching},
author = {Fabrizio Caselli and Christian Krattenthaler and Bodo Lass and Philippe Nadeau},
journal= {arXiv preprint arXiv:math/0502392},
year = {2007}
}
Comments
AnS-LaTeX, 43 pages; Journal version