UW Combinatorics and Geometry Seminar: Changxin Ding

For a finite connected graph, the following objects have the same cardinality: the set of spanning trees, the Jacobian group, the set of equivalence classes of orientations up to cycle-cocycle reversal, the set of break divisors, the set of reduced divisors (a.k.a parking functions). In this talk, I will introduce these objects and some bijections among them.