Rank of divisors on tropical curves
From MaRDI portal
Publication:2349185
DOI10.1016/j.jcta.2013.05.002zbMath1317.14137arXiv0709.4485OpenAlexW2099082421WikidataQ57601364 ScholiaQ57601364MaRDI QIDQ2349185
Daniel Král', Serguei Norine, Jan Hladký
Publication date: 19 June 2015
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0709.4485
Related Items
Discrete and metric divisorial gonality can be different, Logarithmic Picard groups, chip firing, and the combinatorial rank, Effective divisor classes on metric graphs, The gonality sequence of complete graphs, Riemann-Roch theory for weighted graphs and tropical curves, Newton polygons and curve gonalities, Brill-Noether theory of curves on \( \mathbb{P}^1 \times \mathbb{P}^1\): tropical and classical approaches, On approximating the rank of graph divisors, Gonality of complete graphs with a small number of omitted edges, Generalized Riemann functions, their weights, and the complete graph, Treewidth is a lower bound on graph gonality, On metric graphs with prescribed gonality, Clifford's theorem for graphs, Catalan-many tropical morphisms to trees. Part I: Constructions, Generators of invariant linear system on tropical curves for finite isometry group, A note on Brill-Noether existence for graphs of low genus, Computing graph gonality is hard, The sandpile model on \(K_{m,n}\) and the rank of its configurations, Infinite reduction of divisors on metric graphs, Free divisors on metric graphs, Effective faithful tropicalizations associated to linear systems on curves, Degeneration of Linear Series from the Tropical Point of View and Applications, Gonality Sequences of Graphs, CANONICAL REPRESENTATIVES FOR DIVISOR CLASSES ON TROPICAL CURVES AND THE MATRIX–TREE THEOREM, Reduced divisors and embeddings of tropical curves, Galois quotients of tropical curves and invariant linear systems, Linear series on metrized complexes of algebraic curves, Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
