Negative-integer factorization conjecture for fully packed loop polynomials
Negative-integer factorization conjecture for fully packed loop polynomials
Let be a matching and let be an integer with such that . Write , where , and define . Negative-integer factorization conjecture.
This conjecture concerns the special values at negative integers and is supported by computations for all matchings of size at most ; its general validity remains open.
Sources & referencesView supporting material
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
Sign in to submit a solution.
No solutions have been posted yet.