Proof of two conjectures of Zuber on fully packed loop configurations - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue J. Combin. Theory Ser. A Année : 2004

Proof of two conjectures of Zuber on fully packed loop configurations

Résumé

Two 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.

Dates et versions

hal-00129282 , version 1 (06-02-2007)

Identifiants

Citer

F. Caselli, C. Krattenthaler. Proof of two conjectures of Zuber on fully packed loop configurations. J. Combin. Theory Ser. A, 2004, 108, pp.123-146. ⟨hal-00129282⟩
37 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More