On the number of fully packed loop configurations with a fixed associated matching

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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].
AnS-LaTeX, 43 pages; Journal version

Keywords

Combinatorics, Mathematical Physics, Primary 05A15; Secondary 05B45 05E05 05E10 82B23

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/96433

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0502392
 http://arxiv.org/abs/math/0502392
 Electronic J. Combin. 11(2) (2005), Article #R16, 43 pp

Collections

arXiv