Mitra–Pyatov conjecture for the number of HSFPL diagrams

About 17 years old · traced to

Let an FPL diagram of size LL have size (L−1)×L/2(L-1)\times L/2 when LL is even and size L×(L−1)/2L\times (L-1)/2 when LL is odd. Let dd be its depth, and let S(L,d)S(L,d) denote the total number of HSFPL diagrams of size LL and depth dd. Here (a)k(a)_k denotes the rising factorial and Γ\Gamma denotes the gamma function. Mitra–Pyatov conjecture. The total number is

S(L,d)=∏k=0dΓ(L−k+1)2k(1/2)kΓ(L−2k+1)Γ(2L+2k+36)Γ(L−2k+33)Γ(2L−k+36)Γ(2L−k+66).S(L,d)=\prod_{k=0}^{d}\frac{\Gamma(L-k+1)}{2^k(1/2)_k\Gamma(L-2k+1)}\frac{\Gamma\left(\frac{2L+2k+3}{6}\right)\Gamma\left(\frac{L-2k+3}{3}\right)}{\Gamma\left(\frac{2L-k+3}{6}\right)\Gamma\left(\frac{2L-k+6}{6}\right)}.

Assuming the RS conjecture, this formula was subsequently proved, so the conjecture is resolved.

References

Primary source

Jan de Gier, “Fully packed loop models on finite geometries”, arXiv:0901.3963 (2009).

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.