Title:
Combinatorial divisor theory for graphs

dc.contributor.advisor Baker, Matthew
dc.contributor.author Backman, Spencer Christopher Foster
dc.contributor.committeeMember Thomas, Robin
dc.contributor.committeeMember Yu, Josephine
dc.contributor.committeeMember Pokutta, Sebastian
dc.contributor.committeeMember Sergey Norin
dc.contributor.department Mathematics
dc.date.accessioned 2014-05-22T15:36:04Z
dc.date.available 2014-05-22T15:36:04Z
dc.date.created 2014-05
dc.date.issued 2014-04-08
dc.date.submitted May 2014
dc.date.updated 2014-05-22T15:36:04Z
dc.description.abstract 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.
dc.description.degree Ph.D.
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/51908
dc.language.iso en_US
dc.publisher Georgia Institute of Technology
dc.subject Chip-firing
dc.subject Graph
dc.subject Tropical curve
dc.subject Riemann-Roch
dc.subject Orientation
dc.subject.lcsh Divisor theory
dc.subject.lcsh Combinatorial analysis
dc.subject.lcsh Graph theory
dc.subject.lcsh Geometry, Algebraic
dc.subject.lcsh Number theory
dc.title Combinatorial divisor theory for graphs
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.advisor Baker, Matthew
local.contributor.corporatename College of Sciences
local.contributor.corporatename School of Mathematics
relation.isAdvisorOfPublication 75311810-65b1-47d2-a814-686819f79602
relation.isOrgUnitOfPublication 85042be6-2d68-4e07-b384-e1f908fae48a
relation.isOrgUnitOfPublication 84e5d930-8c17-4e24-96cc-63f5ab63da69
thesis.degree.level Doctoral
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
BACKMAN-DISSERTATION-2014.pdf
Size:
760.38 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
LICENSE.txt
Size:
3.87 KB
Format:
Plain Text
Description: