On the number of fully packed loop configurations with a fixed associated matching

Simple item page
dc.creatorCaselli, Fabrizio
dc.creatorKrattenthaler, Christian
dc.creatorLass, Bodo
dc.creatorNadeau, Philippe
dc.date2005-02-17
dc.date2005-04-22
dc.date.accessioned2026-07-07T06:24:07Z
dc.date.available2026-07-07T06:24:07Z
dc.descriptionWe show that the number of fully packed loop configurations corresponding to a matching with $m$ nested arches is polynomial in $m$ if $m$ is large enough, thus essentially proving two conjectures by Zuber [Electronic J. Combin. 11 (2004), Article #R13].
dc.descriptionAnS-LaTeX, 43 pages; Journal version
dc.identifierhttps://arxiv.org/abs/math/0502392
dc.identifierhttp://arxiv.org/abs/math/0502392
dc.identifierElectronic J. Combin. 11(2) (2005), Article #R16, 43 pp
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/96433
dc.subjectCombinatorics
dc.subjectMathematical Physics
dc.subjectPrimary 05A15; Secondary 05B45 05E05 05E10 82B23
dc.titleOn the number of fully packed loop configurations with a fixed associated matching
dc.typetext

Files

Collections

arXiv