Combinatorial characterization of zero mutable Laurent polynomials on rectangular triangles

For positive integers a,ba,b, let ZMLP(a,b)\textup{ZMLP}(a,b) denote the zero mutable Laurent polynomials associated with the rectangular triangle △(a,b)\triangle(a,b), and assume gcd⁡(a,b)=1\gcd(a,b)=1. Let ZMLPcomb(a,b)\textup{ZMLP}_{\textup{comb}}(a,b) be the set of pairs (a,b)(\mathbf a,\mathbf b) of decreasing partitions of aa and bb satisfying

∑iai2+∑jbj2=ab+1,max⁡(a)≤b,max⁡(b)≤a,\sum_i a_i^2+\sum_j b_j^2=ab+1,\qquad \max(\mathbf a)\leq b,\qquad \max(\mathbf b)\leq a,

with max⁡(a)+max⁡(b)≤max⁡(a,b)\max(\mathbf a)+\max(\mathbf b)\leq\max(a,b).

Combinatorial characterization conjecture. If gcd⁡(a,b)=1\gcd(a,b)=1, then

ZMLP(a,b)=ZMLPcomb(a,b).\textup{ZMLP}(a,b)=\textup{ZMLP}_{\textup{comb}}(a,b).

The combinatorial set is known to contain ZMLP(a,b)\textup{ZMLP}(a,b), so the conjecture asserts that all pairs satisfying the necessary conditions arise from zero mutable Laurent polynomials. The supplied text does not state a general resolution.

References

Primary source

Tim Gräfnitz, “Smoothings from zero mutable Laurent polynomials via log resolutions and divisorial extractions”, arXiv:2503.18661 (2025).

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

No solutions have been posted yet.