Penn Arts & Sciences Logo

CAGE: Philadelphia Area Combinatorics and Alg. Geometry Seminar

Tuesday, April 9, 2019 - 3:00pm

Sarah Brauner

Univ. of Minnesota

Location

Drexel University

Korman Center 245

The divisor theory of graphs views a finite connected graph G as a discrete version of a Riemann surface. As in the case of Riemann surfaces, we are interested in the complete linear system |D| of a divisor D—the collection of non-negative divisors linearly equivalent (via the discrete Laplacian) to D. Unlike the case of Riemann surfaces, the complete linear system of a divisor on a graph is always finite. In this talk, I will discuss methods to characterize and count all complete linear systems on G. Time permitting, I will discuss a generalization of these results in the context of chip-firing on M-matrices. This is joint work with Forrest Glebe and David Perkinson.