Chip-Firing and Riemann-Roch Theory for Directed Graphs

Details Chip-Firing and Riemann-Roch Theory for Directed Graphs Chip-Firing and Riemann-Roch Theory for Directed Graphs

2010-12-01

arxiv.org/abs/1012.0287v2

Mathematics

Combinatorics

Scientific paper

We investigate Riemann-Roch theory for directed graphs. The Riemann-Roch criteria of Amini and Manjunath is generalized to all integer lattices orthogonal to some positive vector. Using generalized notions of a $v_0$-reduced divisor and Dhar's algorithm we investigate two chip-firing games coming from the rows and columns of the Laplacian of a strongly connected directed graph. We discuss how the "column" chip-firing game is related to directed $\vec{G}$-parking functions and the "row" chip-firing game is related to the sandpile model. We conclude with a discussion of arithmetical graphs, which after a simple transformation may be viewed as a special class of directed graphs which will always have the Riemann-Roch property for the column chip-firing game. Examples of arithmetical graphs are provided which demonstrate that either, both, or neither of the two Riemann-Roch conditions may be satisfied for the row chip-firing game.

Affiliated with

Also associated with

No associations

Rating

Chip-Firing and Riemann-Roch Theory for Directed Graphs 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 Chip-Firing and Riemann-Roch Theory for Directed Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Chip-Firing and Riemann-Roch Theory for Directed Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602254