Folding-like techniques for CAT(0) cube complexes
Rylee Lyman (Rutgers)
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 \(\mathrm{CAT}(0)\) cube complexes. We extend their techniques to fundamental groups of non-positively curved cube complexes.
algebraic topologydifferential geometrydynamical systemsgroup theorygeometric topologysymplectic geometry
Audience: researchers in the topic
Series comments: You can also find up-to-date information on the seminar homepage - warwick.ac.uk/fac/sci/maths/research/events/seminars/areas/geomtop/
The talks start five minutes after the hour. Talks are typically 55 minutes long, including time for questions.
Organizers: | Saul Schleimer*, Robert Kropholler* |
*contact for this listing |