Computing linear systems on metric graphs

From MaRDI portal
Publication:1690779

DOI10.1016/J.JSC.2017.05.007zbMATH Open1388.14094arXiv1603.00547OpenAlexW2289433421MaRDI QIDQ1690779FDOQ1690779


Authors: Bo Lin Edit this on Wikidata


Publication date: 12 January 2018

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: The linear system |D| of a divisor D on a metric graph has the structure of a cell complex. We introduce the anchor divisors and anchor cells in it - they serve as the landmarks for us to compute the f-vector of the complex and find all cells in the complex. A linear system can also be identified as a tropical convex hull of rational functions. We compute its extremal generators using the landmarks. We apply these methods to some examples - namely the canonical linear systems of some small trivalent graphs.


Full work available at URL: https://arxiv.org/abs/1603.00547




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Computing linear systems on metric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690779)