Connectivity Properties for Actions on Locally Finite Trees
Abstract
Given an action by a finitely generated group G on a locally finite tree T, we view points of the visual boundary ∂T as directions in T and use to lift this sense of direction to G. For each point E ∈ ∂T, this allows us to ask if G is (n - 1)-connected "in the direction of E". The invariant n() ⊂eq ∂T then records the set of directions in which G is (n-1)-connected. In this paper, we introduce a family of actions for which 1() can be calculated through analysis of certain quotient maps between trees. We show that for actions of this sort, under reasonable hypotheses, 1() consists of no more than a single point. By strengthening the hypotheses, we are able to characterize precisely when a given end point lies in n() for any n.
0