A combination theorem for affine tree-free groups

Abstract

Let [Formula: see text] be an ordered abelian group. We show how a group admitting a free affine action without inversions on a [Formula: see text]-tree admits a natural graph of groups decomposition, where vertex groups inherit actions on [Formula: see text]-trees. We introduce a stronger condition (essential freeness) on an affine action and apply recent work of various authors to deduce that a finitely generated group admitting an essentially free affine action on a [Formula: see text]-tree is relatively hyperbolic with nilpotent parabolics, is locally relatively 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 have a free affine action on a [Formula: see text]-tree but that do not act freely by isometries on any [Formula: see text]-tree. We also give an example of a group that admits a free isometric action on a [Formula: see text]-tree but which is not residually nilpotent.