A combination theorem for affine tree-free groups
Shane O Rourke

TL;DR
This paper establishes a decomposition theorem for affine tree-free groups acting on $bZ imes bLambda_0$-trees, linking their structure to graphs of groups and exploring implications for group properties such as hyperbolicity and residual nilpotency.
Contribution
It introduces a graph of groups decomposition for affine tree-free groups and constructs new examples of such groups with specific algebraic properties.
Findings
Groups admit a natural graph of groups decomposition.
Finitely generated groups are relatively hyperbolic with nilpotent parabolics.
Existence of groups acting on $bZ imes bZ$-trees that are not residually nilpotent.
Abstract
Let be an ordered abelian group. We show how an group -- that is, a group admitting a free affine action without inversions on a -tree -- admits a natural graph of groups decomposition, where vertex groups inherit actions on -trees. Using recent work of various authors, it follows that a finitely generated group admitting a free affine action on a -tree where no line has its orientation reversed is relatively hyperbolic with nilpotent parabolics, is locally quasiconvex, and has solvable word, conjugacy and isomorphism problems. Conversely, given a graph of groups satisfying certain conditions, we show how an affine action of its fundamental group can be constructed. Specialising to the case of free affine actions, we obtain a large class of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
