\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
\nopagenumbers
\noindent
%
%
{\bf F. Caselli, C. Krattenthaler, B. Lass and P. Nadeau}
%
%
\medskip
\noindent
%
%
{\bf On the Number of Fully Packed Loop Configurations
with a Fixed Associated Matching}
%
%
\vskip 5mm
\noindent
%
%
%
%
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 [{\it Electronic J. Combin.} {\bf11}(1) (2004),
Article~\#R13].
\bye