Wieland-type chord-diagram identity for fully packed loops

At least 14 years old · documented by

Let i,j,ℓ,m≥0i,j,\ell,m\geq 0, and let AXA_X denote the number associated with a link pattern XX in the paper's chord-diagram notation. Wieland-type chord-diagram conjecture. The equality displayed in the source holds:

the left-hand fully packed loop quantity=the sum represented on the right over Ci+j+1 chord diagrams.\text{the left-hand fully packed loop quantity}=\text{the sum represented on the right over }C_{i+j+1}\text{ chord diagrams}.

This is the fully packed loop relation obtained from the preceding special-values conjecture. Because the displayed diagram is not available in the supplied text, the exact quantities and their dependence on i,j,ℓ,mi,j,\ell,m cannot be reconstructed here.

References

Primary source

Philippe Nadeau, “Fully Packed Loop configurations in a triangle”, arXiv:1111.6027 (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.