BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20251105T170450EST-3087sCIMUk@132.216.98.100
DTSTAMP:20251105T220450Z
DESCRIPTION:Title:Revisiting Leighton's graph covering theorem\n\nLeighton'
 s graph covering theorem states that two finite graphs with isomorphic uni
 versal covers have isomorphic finite covers. I will discuss a new proof th
 at involves using the Haar measure to solve a set of gluing equations. I w
 ill discuss generalizations to graphs with fins\, and applications to quas
 i-isometric rigidity.\n
DTSTART:20181003T190000Z
DTEND:20181003T200000Z
LOCATION:Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue Sherbrooke 
 Ouest
SUMMARY:Daniel Woodhouse (Technion)
URL:/mathstat/channels/event/daniel-woodhouse-technion
 -290306
END:VEVENT
END:VCALENDAR