Fully packed loop configurations: polynomiality and nested arches (Q1700794)

Summary: This article proves a conjecture by \textit{J. B. Zuber} [Electron. J. Comb. 11, No. 1, Research paper R13, 15 p. (2004; Zbl 1054.05011)] about the enumeration of fully packed loops (FPLs). The conjecture states that the number of FPLs whose link pattern consists of two noncrossing matchings which are separated by \(m\) nested arches is a polynomial function in \(m\) of certain degree and with certain leading coefficient. Contrary to the approach of \textit{F. Caselli} et al. [ibid. 11, No. 2, Research paper R16, 43 p. (2004; Zbl 1060.05005)] (who proved a partial result) we make use of the theory of wheel polynomials developed by \textit{P. Di Francesco} and \textit{P. Zinn-Justin} [ibid. 12, No. 1, Research paper R6, 27 p. (2005; Zbl 1108.05013)], \textit{T. Fonseca} and \textit{P. Zinn-Justin} [ibid. 15, No. 1, Research Paper R81, 35 p. (2008; Zbl 1206.05015)]. We present a new basis for the vector space of wheel polynomials and a polynomiality theorem in a more general setting. This allows us to finish the proof of Zubers conjecture.