Linear Systems on Edge-Weighted Graphs
Algebraic Geometry
2017-11-13 v1 Combinatorics
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.
Keywords
Cite
@article{arxiv.1105.0227,
title = {Linear Systems on Edge-Weighted Graphs},
author = {Rodney James and Rick Miranda},
journal= {arXiv preprint arXiv:1105.0227},
year = {2017}
}
Comments
11 pages