Hyperelliptic graphs and metrized complexes

dc.contributor.author	Len, Yoav
dc.date.accessioned	2020-06-24T10:30:02Z
dc.date.available	2020-06-24T10:30:02Z
dc.date.issued	2017
dc.identifier	268424393
dc.identifier	52266ef8-70ce-4677-8214-1dcc65a15415
dc.identifier	85057480985
dc.identifier.citation	Len , Y 2017 , ' Hyperelliptic graphs and metrized complexes ' , Forum of Mathematics, Sigma , vol. 5 , e20 . https://doi.org/10.1017/fms.2017.13	en
dc.identifier.issn	2050-5094
dc.identifier.other	Bibtex: Len2
dc.identifier.other	ORCID: /0000-0002-4997-6659/work/75610603
dc.identifier.uri	https://hdl.handle.net/10023/20138
dc.description.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.
dc.format.extent	15
dc.format.extent	251343
dc.language.iso	eng
dc.relation.ispartof	Forum of Mathematics, Sigma	en
dc.subject	QA Mathematics	en
dc.subject	T-NDAS	en
dc.subject	BDC	en
dc.subject.lcc	QA	en
dc.title	Hyperelliptic graphs and metrized complexes	en
dc.type	Journal article	en
dc.contributor.institution	University of St Andrews. Pure Mathematics	en
dc.identifier.doi	10.1017/fms.2017.13
dc.description.status	Peer reviewed	en