Castryck–Cools generic gonality conjecture for lattice polygons
Castryck–Cools generic gonality conjecture for lattice polygons
Let be a two-dimensional lattice polygon. For a Laurent polynomial , write for its Newton polygon, and let denote the corresponding curve in the torus. The lattice width of a polygon is denoted by ; let be the standard -simplex and let . The sharpest applicable bound is , except that it is when is equivalent to for some or to . Castryck–Cools' generic gonality conjecture. The set of irreducible Laurent polynomials for which and this sharpest applicable bound is attained is Zariski dense in the space of Laurent polynomials for which . The conjecture is proved for all lattice polygons of lattice width at most and in numerous additional cases; computational evidence supports it up to genus , but the general statement remains open.
Sources & referencesView supporting material
Primary source
Wouter Castryck and Filip Cools, “Newton polygons and curve gonalities”, arXiv:1106.3762 (2012).
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.