Mitra–Pyatov conjecture for the number of HSFPL diagrams
Mitra–Pyatov conjecture for the number of HSFPL diagrams
Let an FPL diagram of size have size when is even and size when is odd. Let be its depth, and let denote the total number of HSFPL diagrams of size and depth . Here denotes the rising factorial and denotes the gamma function. Mitra–Pyatov conjecture. The total number is
Assuming the RS conjecture, this formula was subsequently proved, so the conjecture is resolved.
Sources & referencesView supporting material
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
Sign in to submit a solution.
No solutions have been posted yet.