Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns (Q870036): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Paul Zinn-Justin / rank | |||
| Property / author | |||
| Property / author: Paul Zinn-Justin / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0607183 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:18, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns |
scientific article |
Statements
Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns (English)
0 references
12 March 2007
0 references
Summary: 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.
0 references
