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

By Matthew Baker, Sergey Norin. 2006

512 citations recorded by the source corpus.

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.

Subfields: Geometry and Topology, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/92170231069fd144805ba9c356ee002db123381b

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Geometry and Topology

  1. David Jensen
  2. Matthew Baker
  3. Omid Amini
  4. Sam Payne
  5. Dhruv Ranganathan
  6. Lucia Caporaso
  7. Joseph Rabinoff
  8. Erwan Brugallé

In Mathematical Physics

  1. David Jensen
  2. Matthew Baker
  3. Dhruv Ranganathan
  4. Omid Amini
  5. Joseph Rabinoff
  6. Sam Payne
  7. Lucia Caporaso
  8. Erwan Brugallé

Citations in the corpus