Fully packed loop configurations:polynomiality and nested arches
1 : Fakultät für Mathematik [Wien]
	                             - 
	                            Website
Universität Wien, Oskar-Morgenstern-Platz 1, 1090 Vienna, Austria - 
                               Autriche
This extended abstract proves that the number of fully packed loop configurations whose link pattern
 consists of two noncrossing matchings separated by m nested arches is a polynomial in m. This was conjectured by
 Zuber (2004) and for large values of m proved by Caselli et al. (2004)
- Poster


 PDF version
 PDF version

