Riemann-Roch theory on finite sets

DOI10.5427/JSING.2014.9GMaRDI QIDQ2879065zbMATH OpenOpenAlexFDO

Authors Rodney James, Rick Miranda

Publication date 8 September 2014

Published in Journal of Singularities (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1202.0247

Mathematics Subject Classification ID

Riemann-Roch theorems (14C40)

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.

Review text

In [Adv. Math. 215, No. 2, 766--788 (2007; Zbl 1124.05049)], \textit{M. Baker} and \textit{S. Norine} proved a Riemann-Roch theorem for finite graphs and convincingly explained why their theorem is a discrete analogue of the classical Riemann-Roch theorem for Riemann surfaces. In [Proc.\ Am.\ Math.\ Soc.~141, No.~11, 3793--3802 (2013; Zbl 1270.05053)]; Rocky Mt.\ J.\ Math.~46, No.~5, 1559--1574 (2016; Zbl 1351.05101)], the authors of the paper under review generalised the Baker-Norine theorem to weighted graphs and gave a new proof. After re-interpreting the dimension function for divisors and showing that a certain set of divisors is symmetric with respect to the canonical divisor, their new proof becomes surprisingly short, slick and straightforward.NEWLINENEWLINEIn the paper under review, the authors use the latter proof to establish a Riemann-Roch theorem in the following even more general setting. Rather than assuming that the divisors are defined on the set of vertices of a graph they now assume that the divisors are defined on an arbitrary finite set, they now use the re-interpretation as the definition of the dimension function and they make the symmetry result mentioned above an assumption. The paper concludes with small graph examples and one non-graph example.

Recommendations

• scientific article; zbMATH DE number 3979434
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• scientific article; zbMATH DE number 1101449
• scientific article; zbMATH DE number 3927074
• scientific article; zbMATH DE number 219952
• Riemann-Roch spaces and computation
• On Grothendieck's Riemann-Roch theorem
• scientific article; zbMATH DE number 66059
• Extremal Finite Set Theory
• scientific article; zbMATH DE number 3064199

Cites work

• A Riemann-Roch theorem for edge-weighted graphs
• A Riemann-Roch theorem in tropical geometry
• Algebraic and combinatorial rank of divisors on finite graphs
• Linear systems on edge-weighted graphs
• Rank of divisors on graphs: an algebro-geometric analysis
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• Riemann-Roch theory for weighted graphs and tropical curves

Cited in

(14)

• Riemann-Roch for sub-lattices of the root lattice \(A_n\)
• Brill-Noether existence on graphs via \(\mathbb{R}\)-divisors, polytopes and lattices
• Linear systems on edge-weighted graphs
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• Chip-firing based methods in the Riemann-Roch theory of directed graphs
• A Riemann-Roch theorem in tropical geometry
• A Riemann-Roch theorem for edge-weighted graphs
• Two-variable zeta-functions on graphs and Riemann-Roch theorems
• scientific article; zbMATH DE number 3979434 (Why is no real title available?)
• Riemann-Roch theory for weighted graphs and tropical curves
• A Riemann-Roch theorem for hypermaps
• Riemann-Roch theory for graph orientations
• Generalized Riemann functions, their weights, and the complete graph
• Royden compactification of integers

This page was built for publication: Riemann-Roch theory on finite sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879065)