Linear systems on edge-weighted graphs
From MaRDI portal
Abstract: Let R be any subring of the reals. We present a generalization of linear systems on graphs where divisors are R-valued functions on the set of vertices and graph edges are permitted to have nonegative weights in R. Using this generalization, we provide an independent proof of a Riemann-Roch formula, which implies the Riemann-Roch formula of Baker and Norine.
Recommendations
Cited in
(9)- Computing linear systems on metric graphs
- A Riemann-Roch theorem for edge-weighted graphs
- Riemann-Roch theory on finite sets
- On the linearization of weighted T-systems
- scientific article; zbMATH DE number 7301092 (Why is no real title available?)
- The Ablowitz-Ladik system on a graph
- Enumerating linear systems on graphs
- Enumerating linear systems on graphs
- Generalized Riemann functions, their weights, and the complete graph
This page was built for publication: Linear systems on edge-weighted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374287)