Vertically symmetric nest distribution conjecture

Let (a)k=Γ(a+k)/Γ(a)(a)_k=\Gamma(a+k)/\Gamma(a), let G=G2nVG=G^{\rm V}_{2n} be the vertically symmetric fully packed loop grid, and let PG(k)P_G(k) denote the number of diagrams with kk nests. Define

A2n+1V=j=0n1(3j+2)(6j+3)!(2j+1)!(4j+2)!(4j+3)!=1,3,26,646,.A^{\rm V}_{2n+1}=\prod_{j=0}^{n-1}(3j+2)\frac{(6j+3)!(2j+1)!}{(4j+2)!(4j+3)!}=1,3,26,646,\ldots.

Vertically symmetric nest distribution conjecture. The nest distribution is

PG(k)=k4n+k27n(1/2)n+k(1/3)2n(3n+1)!(2nk1)!n!(nk)!(2n+k+1)!A2n+1V.P_G(k)=k\frac{4^{n+k}}{27^n}\frac{(1/2)_{n+k}}{(1/3)_{2n}}\frac{(3n+1)!(2n-k-1)!}{n!(n-k)!(2n+k+1)!}A^{\rm V}_{2n+1}.

Here A2n+1VA^{\rm V}_{2n+1} is the number of vertically symmetric (2n+1)×(2n+1)(2n+1)\times(2n+1) ASMs. The conjecture was checked for nn up to 88, but remains unresolved in the supplied text.

Sources & referencesView supporting material

Primary source

Jan de Gier, “Loops, matchings and alternating-sign matrices”, arXiv:math/0211285 (2003).

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.