This material has been published in
J. Combin. 11(2) (2005), Article #R16, 43 pp.
On the number of fully packed loop configurations
with a fixed associated matching
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].
The following versions are available:
Back to Christian Krattenthaler's