Proof of two conjectures of Zuber on fully packed loop configurations

Details Proof of two conjectures of Zuber on fully packed loop configurations Proof of two conjectures of Zuber on fully packed loop configurations

2003-12-10

arxiv.org/abs/math/0312217v2

J. Combin. Theory Ser. A 108 (2004), 123-146.

Mathematics

Combinatorics

20 pages; AmS-LaTeX

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Proof of two conjectures of Zuber on fully packed loop configurations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Proof of two conjectures of Zuber on fully packed loop configurations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof of two conjectures of Zuber on fully packed loop configurations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-461004