Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns
The electronic journal of combinatorics, Tome 13 (2006)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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 MacMahon formula for the number of plane partitions which includes three series of parameters.
DOI : 10.37236/1136
Classification : 82B23, 82B20, 05A19
@article{10_37236_1136,
     author = {P. Zinn-Justin},
     title = {Proof of the {Razumov-Stroganov} conjecture for some infinite families of link patterns},
     journal = {The electronic journal of combinatorics},
     year = {2006},
     volume = {13},
     doi = {10.37236/1136},
     zbl = {1119.82018},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1136/}
}
TY  - JOUR
AU  - P. Zinn-Justin
TI  - Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns
JO  - The electronic journal of combinatorics
PY  - 2006
VL  - 13
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1136/
DO  - 10.37236/1136
ID  - 10_37236_1136
ER  - 
%0 Journal Article
%A P. Zinn-Justin
%T Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns
%J The electronic journal of combinatorics
%D 2006
%V 13
%U http://geodesic.mathdoc.fr/articles/10.37236/1136/
%R 10.37236/1136
%F 10_37236_1136
P. Zinn-Justin. Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns. The electronic journal of combinatorics, Tome 13 (2006). doi: 10.37236/1136

Cité par Sources :