Finite covers of graphs and cube complexes

<p>In this thesis we study finite covers of graphs, cube complexes and related spaces, and explore applications to rigidity of groups.</p> <p>Leighton's Theorem states that two finite graphs with a common universal cover must have a common finite cover. We prove three general...

Full description

Bibliographic Details
Main Author: Shepherd, S
Other Authors: Bridson, M
Format: Thesis
Language:English
Published: 2021
Subjects:
_version_ 1797050717286957056
author Shepherd, S
author2 Bridson, M
author_facet Bridson, M
Shepherd, S
author_sort Shepherd, S
collection OXFORD
description <p>In this thesis we study finite covers of graphs, cube complexes and related spaces, and explore applications to rigidity of groups.</p> <p>Leighton's Theorem states that two finite graphs with a common universal cover must have a common finite cover. We prove three generalisations of this. The first restricts how balls of a given size in the universal cover can map down to the two finite graphs when factoring through the common finite cover. The second generalises to covers of graphs of spaces that restrict to isomorphisms between vertex spaces. And thirdly, if the two finite graphs admit regular coverings by the same quasitree, then we arrange for the common finite cover to also be covered by this quasitree. In addition, we provide counter-examples to show that the assumptions in these generalisations cannot be relaxed.</p> <p>Central to Haglund and Wise's theory of special cube complexes is the construction of the canonical completion and retraction, which enables one to build finite covers of special cube complexes in a highly controlled manner. We give a new approach to this construction with the idea of imitator covers. This idea provides greater insight into the construction and leads to powerful generalisations. It enables us to prove various results about finite covers of special cube complexes - most of which generalise existing theorems of Haglund and Wise to the non-hyperbolic setting. In particular, we prove a convex version of omnipotence for virtually special cubulated groups. Continuing the theme of special cube complexes, we give a novel account of Agol's proof that hyperbolic cubulated groups are virtually special; we retain the underlying ideas and constructions of Agol, but substantially change or add to many parts of the argument to give a more transparent and detailed account.</p> <p>Finally, we apply Leighton-type arguments similar to those in the aforementioned results to obtain a quasi-isometric rigidity theorem. To be more precise, let <em>G</em> be a group that is one-ended, hyperbolic relative to virtually abelian subgroups, and has JSJ decomposition over two-ended subgroups containing only virtually free vertex groups that aren't quadratically hanging; we prove that any group quasi-isometric to <em>G</em> is abstractly commensurable to <em>G</em>. In particular, this theorem applies to certain "generic" HNN extensions of a free group over cyclic subgroups.</p>
first_indexed 2024-03-06T18:09:19Z
format Thesis
id oxford-uuid:02760160-db50-4f1d-8242-2fa6a6b70939
institution University of Oxford
language English
last_indexed 2024-03-06T18:09:19Z
publishDate 2021
record_format dspace
spelling oxford-uuid:02760160-db50-4f1d-8242-2fa6a6b709392022-03-26T08:41:01ZFinite covers of graphs and cube complexesThesishttp://purl.org/coar/resource_type/c_db06uuid:02760160-db50-4f1d-8242-2fa6a6b70939MathematicsEnglishHyrax Deposit2021Shepherd, SBridson, MKielak, DHagen, M<p>In this thesis we study finite covers of graphs, cube complexes and related spaces, and explore applications to rigidity of groups.</p> <p>Leighton's Theorem states that two finite graphs with a common universal cover must have a common finite cover. We prove three generalisations of this. The first restricts how balls of a given size in the universal cover can map down to the two finite graphs when factoring through the common finite cover. The second generalises to covers of graphs of spaces that restrict to isomorphisms between vertex spaces. And thirdly, if the two finite graphs admit regular coverings by the same quasitree, then we arrange for the common finite cover to also be covered by this quasitree. In addition, we provide counter-examples to show that the assumptions in these generalisations cannot be relaxed.</p> <p>Central to Haglund and Wise's theory of special cube complexes is the construction of the canonical completion and retraction, which enables one to build finite covers of special cube complexes in a highly controlled manner. We give a new approach to this construction with the idea of imitator covers. This idea provides greater insight into the construction and leads to powerful generalisations. It enables us to prove various results about finite covers of special cube complexes - most of which generalise existing theorems of Haglund and Wise to the non-hyperbolic setting. In particular, we prove a convex version of omnipotence for virtually special cubulated groups. Continuing the theme of special cube complexes, we give a novel account of Agol's proof that hyperbolic cubulated groups are virtually special; we retain the underlying ideas and constructions of Agol, but substantially change or add to many parts of the argument to give a more transparent and detailed account.</p> <p>Finally, we apply Leighton-type arguments similar to those in the aforementioned results to obtain a quasi-isometric rigidity theorem. To be more precise, let <em>G</em> be a group that is one-ended, hyperbolic relative to virtually abelian subgroups, and has JSJ decomposition over two-ended subgroups containing only virtually free vertex groups that aren't quadratically hanging; we prove that any group quasi-isometric to <em>G</em> is abstractly commensurable to <em>G</em>. In particular, this theorem applies to certain "generic" HNN extensions of a free group over cyclic subgroups.</p>
spellingShingle Mathematics
Shepherd, S
Finite covers of graphs and cube complexes
title Finite covers of graphs and cube complexes
title_full Finite covers of graphs and cube complexes
title_fullStr Finite covers of graphs and cube complexes
title_full_unstemmed Finite covers of graphs and cube complexes
title_short Finite covers of graphs and cube complexes
title_sort finite covers of graphs and cube complexes
topic Mathematics
work_keys_str_mv AT shepherds finitecoversofgraphsandcubecomplexes