Newton polygons and curve gonalities

From MaRDI portal
Revision as of 06:35, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1686120

DOI10.1007/S10801-011-0304-6zbMath1376.14031arXiv1106.3762OpenAlexW1977516669MaRDI QIDQ1686120

Wouter Castryck, Filip Cools

Publication date: 21 December 2017

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1106.3762





Cites Work


Related Items (14)

Uses Software




This page was built for publication: Newton polygons and curve gonalities