Combinatorial divisor theory for graphs

Thumbnail Image
Backman, Spencer Christopher Foster
Baker, Matthew
Associated Organizations
Organizational Unit
Organizational Unit
Supplementary to
Chip-firing is a deceptively simple game played on the vertices of a graph, which was independently discovered in probability theory, poset theory, graph theory, and statistical physics. In recent years, chip-firing has been employed in the development of a theory of divisors on graphs analogous to the classical theory for Riemann surfaces. In particular, Baker and Norin were able to use this set up to prove a combinatorial Riemann-Roch formula, whose classical counterpart is one of the cornerstones of modern algebraic geometry. It is now understood that the relationship between divisor theory for graphs and algebraic curves goes beyond pure analogy, and the primary operation for making this connection precise is tropicalization, a certain type of degeneration which allows us to treat graphs as “combinatorial shadows” of curves. The development of this tropical relationship between graphs and algebraic curves has allowed for beautiful applications of chip-firing to both algebraic geometry and number theory. In this thesis we continue the combinatorial development of divisor theory for graphs. In Chapter 1 we give an overview of the history of chip-firing and its connections to algebraic geometry. In Chapter 2 we describe a reinterpretation of chip-firing in the language of partial graph orientations and apply this setup to give a new proof of the Riemann-Roch formula. We introduce and investigate transfinite chip-firing, and chip-firing with respect to open covers in Chapters 3 and 4 respectively. Chapter 5 represents joint work with Arash Asadi, where we investigate Riemann-Roch theory for directed graphs and arithmetical graphs, the latter of which are a special class of balanced vertex weighted graphs arising naturally in arithmetic geometry.
Date Issued
Resource Type
Resource Subtype
Rights Statement
Rights URI