Partition characterization of irreducible zero mutable Laurent polynomials
Partition characterization of irreducible zero mutable Laurent polynomials
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.
Sources & referencesView supporting material
Primary source
Tim Gräfnitz, “Smoothings from zero mutable Laurent polynomials via log resolutions and divisorial extractions”, arXiv:2503.18661 (2025).
Progress summary
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.