The link-pattern balance conjecture for the O(1) loop model
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.