Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-13T11:09:19.850Z Has data issue: false hasContentIssue false

HYPERELLIPTIC GRAPHS ANDMETRIZED COMPLEXES

Published online by Cambridge University Press:  30 August 2017

YOAV LEN*
Affiliation:
Department of Combinatorics & Optimization, University of Waterloo, 200 University Avenue West, Waterloo, Ontario, Canada; yoav.len@uwaterloo.ca

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Creative Commons
Creative Common License - CCCreative Common License - BY
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