Revisiting Leighton’s theorem with the Haar measure
Keyword(s):
Abstract Leighton’s graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton’s theorem that allows generalisations; we prove the corresponding result for graphs with fins. As a corollary we obtain pattern rigidity for free groups with line patterns, building on the work of Cashen–Macura and Hagen–Touikan. To illustrate the potential for future applications, we give a quasi-isometric rigidity result for a family of cyclic doubles of free groups.
2013 ◽
Vol 22
(6)
◽
pp. 885-909
◽
Keyword(s):
2016 ◽
Vol 16
(2)
◽
pp. 621-673
◽
2018 ◽
Vol 40
(1)
◽
pp. 117-141
◽
Keyword(s):
Keyword(s):
2009 ◽
Vol 29
(1)
◽
pp. 117-136
◽
Keyword(s):
1987 ◽
Vol 45
◽
pp. 384-385
Keyword(s):
1993 ◽
Vol 51
◽
pp. 872-873