Geometry, Topology and Dynamics Seminar
Daniel Woodhouse
The Technion
Revisiting Leighton's graph covering theorem
Abstract: Leighton's graph covering theorem states that two finite graphs with isomorphic universal covers have isomorphic finite covers. I will discuss a new proof that involves using the Haar measure to solve a set of gluing equations. I will discuss generalizations to graphs with fins, and applications to quasi-isometric rigidity.
Monday October 29, 2018 at 3:00 PM in 636 SEO