The Electronic Journal of Combinatorics, t. 11(2) (Stanley Festschrift), R16, 43 pages, 2004-2006.
Fabrizio Caselli, Christian Krattenthaler, Bodo Lass, Philippe Nadeau
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. t. 11(1) (2004), Article #R13].
Les versions suivantes sont disponibles :
Version du journal :