Negative-integer factorization conjecture for fully packed loop polynomials
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.