The link-pattern balance conjecture for the O(1) loop model
A link-pattern is a noncrossing pairing of the vertices, and denotes the number of fully packed loop states having link-pattern . For each , let be the operation that reconnects the links incident to vertices and as described in the paper, and let be the set of link-patterns such that .
Link-pattern balance conjecture. For any , one has
Equivalently, in the associated game, a uniformly selected FPL state and a uniformly selected operation give equal probabilities of producing any fixed target link-pattern. The conjecture is illustrated for in the source; its general status is not established there.
References
Status
- Solved: Luigi Cantini and Andrea Sportiello. Proof of the Razumov–Stroganov conjecture (Journal of Combinatorial Theory, Series A 118 (2011), 1545–1560, 2011) https://arxiv.org/abs/1003.3376
Source: A. V. Razumov and Yu. G. Stroganov, “Combinatorial nature of ground state vector of O(1) loop model”, arXiv:math/0104216 (2001).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.