Computing linear systems on metric graphs
A metric graph \(\Gamma\) is a connected undirected graph whose edges have positive lengths. A divisor \(D\) on \(\Gamma\) is a formal finite \(\mathbb Z\)-linear combination \(D=\sum_{x\in \Gamma}D(x).x\) of points \(x\) in the edges of \(\Gamma\). The divisor is effective if \(D(x)\geq 0\) for all \(x\in \Gamma\). A (tropical) rational function \(f\) on \(\Gamma\) is a continuous function \(f : \Gamma\rightarrow\mathbb R\) that is piecewise-linear on each edge of \(\Gamma\) with finitely many pieces and integer slopes. The order \(\mathrm{ord}_x(f)\) of \(f\) at a point \(x\in \Gamma\) is the sum of the outgoing slopes at \(x\) along all directions. The principal divisor associated to \(f\) is \((f)=\sum_{x\in \Gamma}\mathrm{ord}_x(f).x\). For any divisor \(D\) on \(\Gamma\), let \(R(D)\) be the set of all rational functions \(f\) on \(\Gamma\) such that the divisor \(D+(f)\) is effective, and \(| D| =\{D+(f) \mid f \in R(D)\}\) be the linear system of \(D\). In the paper under review, the author focuses on the computation of the cell complex \(| D|\), namely given a metric graph \(\Gamma\) and a divisor \(D\) on it, how to find the cells in \(| D|\) and the \(f\)-vector of \(| D|\). Since \(| D|\) may contain a large number of cells and some of these are complicated, the complexity of computation could be high. In this reason, the author introduces the anchor divisors and anchor cells that serve as the landmarks to compute the \(f\)-vector and all cells of \(| D|\). The author also computes the extremal generators of \(R(D)\) and applies his methods to some examples, namely, the canonical linear systems of some small trivalent graphs.
- 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
- A Riemann-Roch theorem in tropical geometry
- Chip-firing games on graphs
- scientific article; zbMATH DE number 6437647 (Why is no real title available?)
- 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
- Generators of invariant linear system on tropical curves for finite isometry group
- Effective divisor classes on metric graphs
- Infinite reduction of divisors on metric graphs
- Explicit computation of certain Arakelov-Green functions
- scientific article; zbMATH DE number 7301092 (Why is no real title available?)
- Schottky algorithms: Classical meets tropical
- Rank-determining sets of metric graphs
- Enumerating linear systems on graphs
- Enumerating linear systems on graphs
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)
