Eventual periodicity of combinatorial zero mutable Laurent polynomial counts
Statement
For positive integers , let be the combinatorially defined set of pairs of partitions used to characterize zero mutable Laurent polynomials on rectangular triangles.
Eventual-periodicity conjecture.
- For each there exists such that for all , the number depends only on modulo .
- For each there exists such that for all , depends only on modulo .
The conjecture is motivated by computed tables for large rectangular triangles. It predicts eventual modular periodicity of the combinatorial upper bound, not directly of the number of zero mutable Laurent polynomials; the supplied text gives no proof.
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.