Fully packed loop configurations : polynomiality and nested arches
2020 ◽
Vol DMTCS Proceedings, 28th...
◽
International audience 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)
2015 ◽
Vol DMTCS Proceedings, 27th...
(Proceedings)
◽
Keyword(s):
2010 ◽
Vol DMTCS Proceedings vol. AN,...
(Proceedings)
◽
Keyword(s):
2008 ◽
Vol DMTCS Proceedings vol. AJ,...
(Proceedings)
◽
Keyword(s):
2018 ◽
Vol 19
(2)
◽
pp. 217-235
Keyword(s):