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

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

2006-08-14

arxiv.org/abs/math/0608360v3

Mathematics

Combinatorics

35 pages. v3: Several minor changes made, mostly fixing typographical errors. This is the final version, to appear in Adv. Mat

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Riemann-Roch and Abel-Jacobi theory on a finite graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Riemann-Roch and Abel-Jacobi theory on a finite graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Riemann-Roch and Abel-Jacobi theory on a finite graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-243161