# Strong accessibility for finitely presented groups

@inproceedings{Louder2017StrongAF, title={Strong accessibility for finitely presented groups}, author={Larsen Louder and Nicholas W. M. Touikan}, year={2017} }

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

#### Citations

##### Publications citing this paper.

SHOWING 1-8 OF 8 CITATIONS

## Essential surfaces in graph pairs

VIEW 2 EXCERPTS

CITES BACKGROUND & METHODS

## A gluing theorem for negatively curved complexes

VIEW 2 EXCERPTS

CITES METHODS & BACKGROUND

## Boundaries of Kleinian groups

VIEW 1 EXCERPT

CITES BACKGROUND

## Effective construction of canonical Hom-diagrams for equations over torsion-free hyperbolic groups

VIEW 1 EXCERPT

CITES BACKGROUND

## Equations over hyperbolic groups

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-6 OF 6 REFERENCES