Florian Aigner - Fully packed loop configurations : polynomiality and nested arches

dmtcs:6341 - Discrete Mathematics & Theoretical Computer Science, April 22, 2020, DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016) - https://doi.org/10.46298/dmtcs.6341
Fully packed loop configurations : polynomiality and nested archesConference paper

Authors: Florian Aigner ORCID1

  • 1 Fakultät für Mathematik [Wien]


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)

https://doi.org/10.46298/dmtcs.6341
Source: HAL:hal-02173795v1
Volume: DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
Published on: April 22, 2020
Imported on: July 4, 2016
Keywords: [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Funding:
    Source : OpenAIRE Graph
  • Compact enumeration formulas for generalized partitions; Code: Y 463

1 Document citing this article

Share and export

Consultation statistics

This page has been seen 345 times.
This article's PDF has been downloaded 290 times.