Newton polygons and curve gonalities

Authors:
Wouter Castryck;Filip Cools
Affiliations:
Departement Wiskunde, Afdeling Algebra, Katholieke Universiteit Leuven, Leuven (Heverlee), Belgium 3001;Departement Wiskunde, Afdeling Algebra, Katholieke Universiteit Leuven, Leuven (Heverlee), Belgium 3001
Venue:
Journal of Algebraic Combinatorics: An International Journal
Year:
2012

Citing 4
Cited 1

The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Rank-determining sets of metric graphs

Journal of Combinatorial Theory Series A
Lattice polygons and families of curves on rational surfaces

Journal of Algebraic Combinatorics: An International Journal
A generalization of Baker's theorem

Finite Fields and Their Applications

Erratum to: Newton polygons and curve gonalities

Journal of Algebraic Combinatorics: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.