A combination theorem for affine tree-free groups
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 groups that do not act freely by isometries on any -tree. We also give an example of a group that admits a free isometric action on a -tree but which is not residually nilpotent.
Cite
@article{arxiv.1503.03788,
title = {A combination theorem for affine tree-free groups},
author = {Shane O Rourke},
journal= {arXiv preprint arXiv:1503.03788},
year = {2016}
}
Comments
28 pages, revised version