Proof of two conjectures of Zuber on fully packed loop configurations

Authors:
Fabrizio Caselli;Christian Krattenthaler
Affiliations:
Institut Girard Desargues, Université Claude Bernard Lyon-I 21 Avenue Claude Bernard, F-69622 Villeurbanne Cedex, France;Institut Girard Desargues, Université Claude Bernard Lyon-I 21 Avenue Claude Bernard, F-69622 Villeurbanne Cedex, France
Venue:
Journal of Combinatorial Theory Series A
Year:
2004

Citing 5
Cited 2

Enumerative combinatorics

Enumerative combinatorics
The problem of Calissons

American Mathematical Monthly
Lattice path proofs for determinantal formulas for symplectic and orthogonal characters

Journal of Combinatorial Theory Series A
Enumeration of Lozenge Tilings of hexagons with a central triangular hole

Journal of Combinatorial Theory Series A
Enumeration of Lozenge tilings of hexagons with cut-off corners

Journal of Combinatorial Theory Series A

Proof of the Razumov-Stroganov conjecture

Journal of Combinatorial Theory Series A
Fully Packed Loop configurations in a triangle

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two conjectures of Zuber (On the counting of fully packed loops configurations. Some new conjectures, Electronic J. Combin 11 (2004)) 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.