Riemann-Roch theory on finite sets

Abstract

In [1] M. Baker and S. Norine developed a theory of divisors and linear systems on graphs, and proved a Riemann-Roch Theorem for these objects (conceived as integer-valued functions on the vertices). In [2] and [3] the authors generalized these concepts to real-valued functions, and proved a corresponding Riemann-Roch Theorem in that setting, showing that it implied the Baker-Norine result. In this article we prove a Riemann-Roch Theorem in a more general combinatorial setting that is not necessarily driven by the existence of a graph.