Hyperelliptic graphs and metrized complexes

Yoav Len

doi:10.1017/fms.2017.13

Hyperelliptic graphs and metrized complexes

Yoav Len

Pure Mathematics

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Article number	e20
Number of pages	15
Journal	Forum of Mathematics, Sigma
Volume	5
Early online date	30 Aug 2017
DOIs	https://doi.org/10.1017/fms.2017.13
Publication status	Published - 2017

Access to Document

10.1017/fms.2017.13Licence: CC BY

Len 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
Final published version, 245 KBLicence: CC BY

Yoav Len
- yoav.lenst-andrews.acuk
- Pure Mathematics - Lecturer in Pure Mathematics
Person: Academic

Cite this

@article{52266ef870ce467782141dcc65a15415,

title = "Hyperelliptic graphs and metrized complexes",

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.",

author = "Yoav Len",

year = "2017",

doi = "10.1017/fms.2017.13",

language = "English",

volume = "5",

journal = "Forum of Mathematics, Sigma",

issn = "2050-5094",

publisher = "Cambridge University Press",

}

TY - JOUR

T1 - Hyperelliptic graphs and metrized complexes

AU - Len, Yoav

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

U2 - 10.1017/fms.2017.13

DO - 10.1017/fms.2017.13

M3 - Article

SN - 2050-5094

VL - 5

JO - Forum of Mathematics, Sigma

JF - Forum of Mathematics, Sigma

M1 - e20

ER -

Hyperelliptic graphs and metrized complexes

Abstract

Access to Document

Fingerprint

Profiles

Yoav Len

Cite this