2011/06/19 by Castryck, Wouter, Cools, Filip · 1 citation
#Algebraic Geometry (math.AG) #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1106.3762
We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number of special cases. One proof technique uses recent work of M. Baker on linear systems on graphs, by means of which we reduce our conjecture to a purely combinatorial statement.