Proof of Razumov-Stroganov conjecture for some infinite families of link patterns

Details Proof of Razumov-Stroganov conjecture for some infinite families of link patterns Proof of Razumov-Stroganov conjecture for some infinite families of link patterns

2006-07-07

arxiv.org/abs/math/0607183v1

Mathematics

Combinatorics

Scientific paper

We prove the Razumov--Stroganov conjecture relating ground state of the O(1) loop model and counting of Fully Packed Loops in the case of certain types of link patterns. The main focus is on link patterns with three series of nested arches, for which we use as key ingredient of the proof a generalization of the Mac Mahon formula for the number of plane partitions which includes three series of parameters.

Affiliated with

Also associated with

No associations

Rating

Proof of Razumov-Stroganov conjecture for some infinite families of link patterns 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 Razumov-Stroganov conjecture for some infinite families of link patterns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proof of Razumov-Stroganov conjecture for some infinite families of link patterns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-97389