Partition characterization of irreducible zero mutable Laurent polynomials
Statement
Let be a lattice polygon, let run over its edges, and let denote the lattice length of . For a zero mutable Laurent polynomial with Newton polygon , let be the decreasing partition associated with the divisibility steps along .
Partition characterization conjecture. Irreducible zero mutable Laurent polynomials on are in one-to-one correspondence with tuples of decreasing partitions of such that
equals the number of lattice points of .
The preceding proposition shows that every zero mutable Laurent polynomial yields such partitions, and the proposition also says the polynomial is determined by them. The conjecture asks whether the stated numerical condition is sufficient; the source mentions evidence from the classification section but gives no general 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.