paper

Hyperelliptic graphs and metrized complexes

arXiv:1601.01968 · doi:10.1017/fms.2017.13

Abstract

We prove a version of Clifford's theorem for metrized complexes. Namely, a metrized complex that carries a divisor of degree and rank (for ) also carries a divisor of degree and rank . 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.

Fixed a gap in Proposition 3.3

References in corpus (2)

Cited by in corpus (2)