Row-sum conjecture for inverse double-dimer matrices

About 16 years old · traced to

Let M−1M^{-1} be the inverse matrix indexed by paths, and let λ\lambda be a row of order nn. For a chord cc of λ\lambda, write ∣c∣|c| for its length, and let fλ/μ(q)f_{\lambda/\mu}(q) denote the associated generating polynomial; write n!qn!_q and ∣c∣q|c|_q for the corresponding qq-analogues. Row-sum conjecture. For any row λ\lambda of M−1M^{-1}, the absolute values of its entries sum to a divisor of n!n!, more precisely

∑μq∣λ/μ∣/2fλ/μ(q1/2)=n!q∏chord c of λ∣c∣q.\sum_\mu q^{|\lambda/\mu|/2}f_{\lambda/\mu}(q^{1/2})=\frac{n!_q}{\prod_{\text{chord }c\text{ of }\lambda}|c|_q}.

At q=1q=1, this gives the stated row sum n!/∏c∣c∣n!/\prod_c|c|. The conjecture is proved for the first row, where the row sum is nn, while the general formula remains unproved in the source.

References

Primary source

Richard W. Kenyon and David B. Wilson, “Double-dimer pairings and skew Young diagrams”, arXiv:1007.2006 (2011).

Progress summary

Never refreshed

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.