College events are closed to the public for now, with the exception of
admission tours. Visitors are welcome outdoors and in select buildings. Everyone must wear masks indoors, regardless of vaccination status. See the Visit page of our
Covid website for full details.
Chip-Firing Games and Graph Gonality by Prof. Ralph Morrison, Mathematics Faculty Seminar
Chip-Firing Games and Graph Gonality by Prof. Ralph Morrison, Mathematics Faculty Seminar, Friday, October 1, 1 – 1:45 pm, NSB 116
Abstract: The gonality of a graph is the smallest number of poker chips we would have to place on a graph so that, using “chip-firing moves”, we can move a chip to any vertex we like (without introducing any debt). In this talk I’ll present a number of results about gonality proved by participants in the SMALL REU (from 2018, 2020, and 2021), including results on the computational complexity of gonality. I’ll also present many open problems on gonality, some of which will be worked on by students currently enrolled in Math 435.