Negative-integer factorization conjecture for fully packed loop polynomials

At least 15 years old · documented by

Let π\pi be a matching and let pp be an integer with 1≤p≤∣π∣−11\leq p\leq|\pi|-1 such that mp(π)=0m_p(\pi)=0. Write π=α∘β\pi=\alpha\circ\beta, where ∣α∣=p|\alpha|=p, and define Gα=Aα(−∣α∣)G_\alpha=A_\alpha(-|\alpha|). Negative-integer factorization conjecture.

Aπ(−p)=GαAβ.A_\pi(-p)=G_\alpha A_\beta.

This conjecture concerns the special values at negative integers and is supported by computations for all matchings of size at most 88; its general validity remains open.

References

Primary source

Tiago Fonseca and Philippe Nadeau, “On some polynomials enumerating Fully Packed Loop configurations”, arXiv:1002.4187 (2010).

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.