Strong accessibility for finitely presented groups

  title={Strong accessibility for finitely presented groups},
  author={Larsen Louder and Nicholas W. M. Touikan},
  • Larsen Louder, Nicholas W. M. Touikan
  • Published 2017
  • Mathematics
  • 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… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv


    Publications citing this paper.


    Publications referenced by this paper.

    Papasoglu, JSJ-decompositions of finitely presented groups and complexes of groups, Geom

    • P. K. Fujiwara
    • Funct. Anal
    • 2006

    Potyagailo, Accessibilité hiérarchique des groupes de présentation

    • Thomas Delzant, Leonid
    • finie, Topology
    • 2001