Article contents
HYPERELLIPTIC GRAPHS AND METRIZED COMPLEXES
Published online by Cambridge University Press: 30 August 2017
Abstract
We prove a version of Clifford’s theorem for metrized complexes. Namely, a metrized complex that carries a divisor of degree $2r$ and rank
$r$ (for
$0<r<g-1$) also carries a divisor of degree 2 and rank 1. We provide a structure theorem for hyperelliptic metrized complexes, and use it to classify divisors of degree bounded by the genus. We discuss a tropical version of Martens’ theorem for metric graphs.
- Type
- Research Article
- Information
- Creative Commons
- This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
- Copyright
- © The Author 2017
References
- 2
- Cited by