arXiv · math/0502392
On the number of fully packed loop configurations with a fixed associated matching
Abstract
We show that the number of fully packed loop configurations corresponding to a matching with $m$ nested arches is polynomial in $m$ if $m$ is large enough, thus essentially proving two conjectures by Zuber [Electronic J. Combin. 11 (2004), Article #R13].
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Fabrizio Caselli, Christian Krattenthaler, Bodo Lass, Philippe Nadeau. 2005-04-22. On the number of fully packed loop configurations with a fixed associated matching. https://searcharxiv.com/abs/math/0502392
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.