2000 character limit reached
Linear Systems on Edge-Weighted Graphs
Published 2 May 2011 in math.AG and math.CO | (1105.0227v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.