arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.05374math.GRmath.GT

Folding-like techniques for CAT(0) cube complexes

Michael Ben-Zvi, Robert Kropholler, Rylee Alanza Lyman

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑