2000 character limit reached
Strong accessibility for finitely presented groups
Published 21 Feb 2013 in math.GR | (1302.5451v2)
Abstract: A hierarchy of a group is a rooted tree of groups obtained by iteratively passing to vertex groups of graphs of groups decompositions. We define a (relative) slender JSJ hierarchy for (almost) finitely presented groups and show that it is finite, provided the group in question doesn't contain any slender subgroups with infinite dihedral quotients and satisfies an ascending chain condition on certain chains of subgroups of edge groups. As a corollary, slender JSJ hierarchies of hyperbolic groups which are (virtually) without $2$--torsion and finitely presented subgroups of SL(n,Z) are both finite.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.