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

Fabrizio Caselli, Christian Krattenthaler, Bodo Lass +1

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…