Proof of two conjectures of Zuber on fully packed loop configurations

Simple item page
dc.creatorCaselli, F.
dc.creatorKrattenthaler, C.
dc.date2003-12-10
dc.date2003-12-11
dc.date.accessioned2026-07-07T05:03:46Z
dc.date.available2026-07-07T05:03:46Z
dc.descriptionTwo conjectures of Zuber [``On the counting of fully packed loops configurations. Some new conjectures,'' preprint] on the enumeration of configurations in the fully packed loop model on the square grid with periodic boundary conditions, which have a prescribed linkage pattern, are proved. Following an idea of de Gier [``Loops, matchings and alternating-sign matrices,'' Discrete Math., to appear], the proofs are based on bijections between such fully packed loop configurations and rhombus tilings, and the hook-content formula for semistandard tableaux.
dc.description20 pages; AmS-LaTeX
dc.identifierhttps://arxiv.org/abs/math/0312217
dc.identifierhttp://arxiv.org/abs/math/0312217
dc.identifierJ. Combin. Theory Ser. A 108 (2004), 123-146.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/69551
dc.subjectCombinatorics
dc.subjectStatistical Mechanics
dc.subjectMathematical Physics
dc.subjectPrimary 05A15; Secondary 05B45 05E05 05E10 82B23
dc.titleProof of two conjectures of Zuber on fully packed loop configurations
dc.typetext

Files

Collections

arXiv