ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A link-pattern is a noncrossing pairing of the 2n2n vertices, and An(π)A_n(π) denotes the number of fully packed loop states having link-pattern ππ. For each i=1,2ni=1,2n, let hih_i be the operation that reconnects the links incident to vertices ii and i+1i+1 as described in the paper, and let Πi(π)Π_i(π) be the set of link-patterns π′π' such that hi(π′)=πh_i(π')=π.

Link-pattern balance conjecture. For any n=1,2,…n=1,2,\ldots, one has

∑i=12n∑π′∈Πi(π)An(π′)=2nAn(π).\sum_{i=1}^{2n}\sum_{\pi'\in\Pi_i(\pi)}A_n(\pi')=2nA_n(\pi).

Equivalently, in the associated game, a uniformly selected FPL state and a uniformly selected operation hih_i give equal probabilities of producing any fixed target link-pattern. The conjecture is illustrated for n=4n=4 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.