Riemann-Roch and Abel-Jacobi theory on a finite graph

From MaRDI portal
Publication:2383008

DOI10.1016/J.AIM.2007.04.012zbMATH Open1124.05049arXivmath/0608360OpenAlexW2083387674MaRDI QIDQ2383008FDOQ2383008


Authors: Matthew Baker, Serguei Norine Edit this on Wikidata


Publication date: 5 October 2007

Published in: Advances in Mathematics (Search for Journal in Brave)

Abstract: It is well-known that a finite graph can be viewed, in many respects, as a discrete analogue of a Riemann surface. In this paper, we pursue this analogy further in the context of linear equivalence of divisors. In particular, we formulate and prove a graph-theoretic analogue of the classical Riemann-Roch theorem. We also prove several results, analogous to classical facts about Riemann surfaces, concerning the Abel-Jacobi map from a graph to its Jacobian. As an application of our results, we characterize the existence or non-existence of a winning strategy for a certain chip-firing game played on the vertices of a graph.


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




Recommendations




Cites Work


Cited In (only showing first 100 items - show all)





This page was built for publication: Riemann-Roch and Abel-Jacobi theory on a finite graph

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