Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Fully packed loop co ...
Conference paper

Fully packed loop configurations : polynomiality and nested arches

Florian Aigner ORCID (1)
(1) Fakultät für Mathematik [Wien]
Download article
Open on HAL
Imported on
July 4, 2016
Published on
April 22, 2020
Last modified on
March 31, 2025
Volume
DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
DOI
10.46298/dmtcs.6341
License
https://about.hal.science/hal-authorisation-v1
Y 463
Indicators
745
Views
523
Downloads

Fully packed loop configurations : polynomiality and nested arches

Florian Aigner ORCID (1)
(1) Fakultät für Mathematik [Wien]
Abstract
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)
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
Cited by

Source: OpenCitations

  • Refined enumerations of alternating sign triangles

    Advances in Applied Mathematics

    Authors : Florian Aigner ORCID

    Journal reference : Volume 111, 2019, pp. 101921

    DOI : 10.1016/j.aam.2019.06.004
Preview
Loading PDF preview...