Hyperelliptic graphs and metrized complexes
MetadataShow full item record
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.
Len , Y 2017 , ' Hyperelliptic graphs and metrized complexes ' , Forum of Mathematics, Sigma , vol. 5 , e20 . https://doi.org/10.1017/fms.2017.13
Forum of Mathematics, Sigma
Copyright © The Author 2017. 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 theoriginal work is properly cited
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.