DOAJ Open Access 2020

Fully packed loop configurations : polynomiality and nested arches

Florian Aigner

Lihat Sumber DOI

Abstrak

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)

Topik & Kata Kunci

Mathematics

Penulis (1)

Florian Aigner

Format Sitasi

APA MLA BibTeX

Aigner, F. (2020). Fully packed loop configurations : polynomiality and nested arches. https://doi.org/10.46298/dmtcs.6341

Akses Cepat

Lihat di Sumber doi.org/10.46298/dmtcs.6341

Informasi Jurnal

Tahun Terbit: 2020
Sumber Database: DOAJ
DOI: 10.46298/dmtcs.6341
Akses: Open Access ✓