Abstract:
To a finite connected graph G, we may associate two Lawrence polytopes. The maximal simplices in any dissection of the Lawrence polytope are in bijection with the spanning trees of G. We may use them to define bijections between the spanning trees of G and the cycle-cocycle reversal classes of orientations of G, which generalizes the work of Bernardi and the work of Backman, Baker, and Yuen. We may also use them to study activities of G and, more specifically, reduced divisors of G, which generalizes the work of Cori and Le Borgne. Based on my work arXiv:2306.07376 and another ongoing work.
Note: This talk begins with a pre-seminar (aimed at graduate students) at 3:30–4:00. The main talk starts at 4:10.
Join Zoom Meeting: https://washington.zoom.us/j/
Meeting ID: 915 4733 5974