Castryck–Cools generic gonality conjecture for lattice polygons

About 15 years old · traced to

Let Δ⊂R2\Delta\subset\mathbb{R}^2 be a two-dimensional lattice polygon. For a Laurent polynomial f∈C[x±1,y±1]f\in\mathbb{C}[x^{\pm 1},y^{\pm 1}], write Δ(f)\Delta(f) for its Newton polygon, and let U(f)U(f) denote the corresponding curve in the torus. The lattice width of a polygon is denoted by lw⁡(Δ)\operatorname{lw}(\Delta); let Σ\Sigma be the standard 22-simplex and let Υ=Conv⁡{(−1,−1),(1,0),(0,1)}\Upsilon=\operatorname{Conv}\{(-1,-1),(1,0),(0,1)\}. The sharpest applicable bound is lw⁡(Δ(f))\operatorname{lw}(\Delta(f)), except that it is lw⁡(Δ(f))−1\operatorname{lw}(\Delta(f))-1 when Δ(f)\Delta(f) is equivalent to dΣd\Sigma for some d≥2d\geq 2 or to 2Υ2\Upsilon. Castryck–Cools' generic gonality conjecture. The set of irreducible Laurent polynomials ff for which Δ(f)=Δ\Delta(f)=\Delta and this sharpest applicable bound is attained is Zariski dense in the space of Laurent polynomials ff for which Δ(f)⊂Δ\Delta(f)\subset\Delta. The conjecture is proved for all lattice polygons of lattice width at most 44 and in numerous additional cases; computational evidence supports it up to genus 1313, but the general statement remains open.

References

Primary source

Wouter Castryck and Filip Cools, “Newton polygons and curve gonalities”, arXiv:1106.3762 (2012).

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.