Computing linear systems on metric graphs
From MaRDI portal
Abstract: The linear system of a divisor 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.
Recommendations
- scientific article; zbMATH DE number 7301092
- Linear systems on edge-weighted graphs
- Enumerating linear systems on graphs
- Enumerating linear systems on graphs
- On the expressive power of linear algebra on graphs
- On the expressive power of linear algebra on graphs
- LINEAR SYSTEMS ON GRAPHS WITH A REAL STRUCTURE
- Algorithms, graph theory, and linear equations in Laplacian matrices
- On the metric dimension of line graphs
- Computing metric hulls in graphs
Cites work
- scientific article; zbMATH DE number 6437647 (Why is no real title available?)
- A Riemann-Roch theorem in tropical geometry
- Chip-firing games on graphs
- Linear systems on tropical curves
- Metrized graphs, Laplacian operators, and electrical networks
- Moduli of tropical plane curves
- Nonarchimedean geometry, tropicalization, and metrics on curves
- Riemann-Roch and Abel-Jacobi theory on a finite graph
- Specialization of linear systems from curves to graphs (with an appendix by Brian Conrad)
- Tropical curves, their Jacobians and theta functions
Cited in
(9)- Infinite reduction of divisors on metric graphs
- Rank-determining sets of metric graphs
- Generators of invariant linear system on tropical curves for finite isometry group
- scientific article; zbMATH DE number 7301092 (Why is no real title available?)
- Enumerating linear systems on graphs
- Enumerating linear systems on graphs
- Explicit computation of certain Arakelov-Green functions
- Effective divisor classes on metric graphs
- Schottky algorithms: Classical meets tropical
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)