Dice Question Streamline Icon: https://streamlinehq.com

Generalizations of the Razumov–Stroganov correspondence

Establish generalizations of the Razumov–Stroganov correspondence asserting that, for six-vertex model configurations with Domain Wall Boundary Conditions mapped to Fully Packed Loop configurations, the vector of configuration counts refined by boundary connectivity is an eigenvector of the Hamiltonian of a quantum integrable system, beyond the case proven by Cantini and Sportiello.

Information Square Streamline Icon: https://streamlinehq.com

Background

In the Razumov–Stroganov correspondence, configurations of the six-vertex model with Domain Wall Boundary Conditions are mapped to Fully Packed Loop (FPL) configurations, and one performs a refined counting by the connectivity pattern of boundary edges. Razumov and Stroganov conjectured that the resulting counting vector is an eigenvector of a matrix which is identified with the Hamiltonian of a quantum integrable system.

This conjecture was proven by Cantini and Sportiello using the gyration operation introduced by Wieland, but the authors note that various generalizations remain open. The generalizations concern extensions of the correspondence to broader contexts in which similar eigenvector relationships between refined FPL enumerations and integrable Hamiltonians are expected.

References

This conjecture was proven in by a nontrivial use of the gyration of , though various generalisations are still open.

Integrability and combinatorics (2404.13221 - Zinn-Justin, 20 Apr 2024) in Section “The Razumov–Stroganov correspondence” (\S\ref{sec:RS})