Riemann-Roch for Toric Rank Functions
Abstract
In this thesis we study toric rank functions for chip firing games and prove special cases of a conjectural Riemann-Roch. The original motivation for an investigation into this area of study came for the adaptation (due to Matt Baker) of Riemann-Roch into a graph theoretic analogue through the use of chip-firing games. Here, we collect known results and present new observations that indicate Riemann--Roch holds for trees and polygons. We also prove an asymptotic case of Riemann--Roch (i.e.~Riemann--Roch for divisors of large degree). Finally, we also provide magma code and computational evidence that Riemann--Roch holds for the toric rank function.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.