Proof of Razumov-Stroganov conjecture for some infinite families of link patterns - Université Paris Cité Accéder directement au contenu
Article Dans Une Revue The Electronic Journal of Combinatorics Année : 2006

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

Résumé

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.

Dates et versions

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

Identifiants

Citer

Paul Zinn-Justin. Proof of Razumov-Stroganov conjecture for some infinite families of link patterns. The Electronic Journal of Combinatorics, 2006, 13, pp.R110. ⟨hal-00129351⟩
80 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More