On the number of fully packed loop configurations with a fixed associated matching
The electronic journal of combinatorics, The Stanley Festschrift volume, Tome 11 (2004) no. 2
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(1) (2004), Article #R13].
@article{10_37236_1873,
author = {F. Caselli and C. Krattenthaler and B. Lass and P. Nadeau},
title = {On the number of fully packed loop configurations with a fixed associated matching},
journal = {The electronic journal of combinatorics},
year = {2004},
volume = {11},
number = {2},
doi = {10.37236/1873},
zbl = {1060.05005},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1873/}
}
TY - JOUR AU - F. Caselli AU - C. Krattenthaler AU - B. Lass AU - P. Nadeau TI - On the number of fully packed loop configurations with a fixed associated matching JO - The electronic journal of combinatorics PY - 2004 VL - 11 IS - 2 UR - http://geodesic.mathdoc.fr/articles/10.37236/1873/ DO - 10.37236/1873 ID - 10_37236_1873 ER -
%0 Journal Article %A F. Caselli %A C. Krattenthaler %A B. Lass %A P. Nadeau %T On the number of fully packed loop configurations with a fixed associated matching %J The electronic journal of combinatorics %D 2004 %V 11 %N 2 %U http://geodesic.mathdoc.fr/articles/10.37236/1873/ %R 10.37236/1873 %F 10_37236_1873
F. Caselli; C. Krattenthaler; B. Lass; P. Nadeau. On the number of fully packed loop configurations with a fixed associated matching. The electronic journal of combinatorics, The Stanley Festschrift volume, Tome 11 (2004) no. 2. doi: 10.37236/1873
Cité par Sources :