The Razumov–Stroganov conjecture: stochastic processes, loops and combinatorics

DOI10.1088/1742-5468/2007/02/N02001zbMath1459.82036arXivcond-mat/0702432OpenAlexW2087409773WikidataQ123275078 ScholiaQ123275078MaRDI QIDQ5239340

Jan De Gier

Publication date: 22 October 2019

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0702432

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (2)

Multiply-refined enumeration of alternating sign matrices ⋮ On the weighted enumeration of alternating sign matrices and descending plane partitions

Cites Work

• Unnamed Item
• Around the Razumov-Stroganov conjecture: proof of a multi-parameter sum rule
• The raise and peel model of a fluctuating interface
• Quantum incompressibility and Razumov Stroganov type conjectures
• Combinatorial nature of the ground-state vector of the \(\mathrm{O}(1)\) loop model
• The importance of being odd
• The quantum symmetricXXZchain at Δ = -½, alternating-sign matrices and plane partitions
• Spin chains and combinatorics
• Loop model with mixed boundary conditions,qKZ equation and alternating sign matrices
• Open boundary quantum Knizhnik–Zamolodchikov equation and the weighted enumeration of plane partitions with symmetries
• The quantum Knizhnik–Zamolodchikov equation, generalized Razumov–Stroganov sum rules and extended Joseph polynomials

This page was built for publication: The Razumov–Stroganov conjecture: stochastic processes, loops and combinatorics