Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns
From MaRDI portal
(Redirected from Publication:870036)
Abstract: 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.
Recommendations
- Proof of the Razumov-Stroganov conjecture
- On the counting of fully packed loop configurations: some new conjectures
- A refined Razumov–Stroganov conjecture
- Proof of two conjectures of Zuber on fully packed loop configurations
- Around the Razumov-Stroganov conjecture: proof of a multi-parameter sum rule
Cited in
(12)- Quantum Knizhnik-Zamolodchikov equation, totally symmetric self-complementary plane partitions, and alternating sign matrices
- Quantum incompressibility and Razumov Stroganov type conjectures
- On some ground state components of the \(O(1)\) loop model
- Exact densities of loops in O(1) dense loop model and of clusters in critical percolation on a cylinder
- On some polynomials enumerating fully packed loop configurations
- The solution of a conjecture of Stanley and Wilf for all layered patterns
- Arctic curves of the six-vertex model on generic domains: the tangent method
- A simple proof for the exponential upper bound for some tenacious patterns
- Proof of the Razumov-Stroganov conjecture
- A refined Razumov–Stroganov conjecture: II
- Grassmann-Grassmann conormal varieties, integrability, and plane partitions
- On the link pattern distribution of quarter-turn symmetric FPL configurations
This page was built for publication: Proof of the Razumov-Stroganov conjecture for some infinite families of link patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870036)