Article contents
Folding-like techniques for CAT(0) cube complexes
Published online by Cambridge University Press: 28 October 2021
Abstract
In a seminal paper, Stallings introduced folding of morphisms of graphs. One consequence of folding is the representation of finitely-generated subgroups of a finite-rank free group as immersions of finite graphs. Stallings’s methods allow one to construct this representation algorithmically, giving effective, algorithmic answers and proofs to classical questions about subgroups of free groups. Recently Dani–Levcovitz used Stallings-like methods to study subgroups of right-angled Coxeter groups, which act geometrically on CAT(0) cube complexes. In this paper we extend their techniques to fundamental groups of non-positively curved cube complexes.
MSC classification
- Type
- Research Article
- Information
- Mathematical Proceedings of the Cambridge Philosophical Society , Volume 173 , Issue 1 , July 2022 , pp. 227 - 238
- Copyright
- © The Author(s), 2021. Published by Cambridge University Press on behalf of Cambridge Philosophical Society
Footnotes
Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy EXC 2044 –390685587, Mathematics Münster: Dynamics Geometry Structure.
References
- 3
- Cited by