Linear Systems on Edge-Weighted Graphs
classification
🧮 math.AG
math.CO
keywords
formulageneralizationgraphslinearriemann-rochsystemsbakerdivisors
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.