Skip to Content

Search: {{$root.lsaSearchQuery.q}}, Page {{$}}

Learning Seminar in Algebraic Combinatorics Seminar

Dimers and Spanning Trees
Wednesday, September 28, 2022
2:30-4:00 PM
4088 East Hall Map
As we have seen, the set of dimer covers on a graph is in bijection with several other interesting objects. In this talk we will discuss a bijection between dimer covers on a graph and spanning trees on a related graph, a generalization of Temperley's classic bijection. The powerful tools developed for spanning trees, like Wilson's algorithm for selecting a uniformly random spanning tree can then be used on dimer covers as well. Speaker(s): Katie Waddle (University of Michigan)
Building: East Hall
Event Type: Workshop / Seminar
Tags: Mathematics
Source: Happening @ Michigan from Department of Mathematics