SearcharxivSearch

arXiv · 1111.0871

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 \partialT as directions in T and use {\rho} to lift this sense of direction to G. For each point E \in \partialT, this allows us to ask if G is (n - 1)-connected "in the direction of E". The invariant {\Sigma}^n({\rho}) \subseteq \partialT then records the set of directions in which G is (n-1)-connected. In this paper, we introduce a family of actions for which {\Sigma}^1({\rho}) can be calculated through analysis of certain quotient maps between trees. We show that for actions of this sort, under reasonable hypotheses, {\Sigma}1({\rho}) 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 {\Sigma}^n({\rho}) for any n.

Explore related subjects

Keep this discovery

BibTeXRIS

Keith Jones. 2011-11-03. Connectivity Properties for Actions on Locally Finite Trees. https://arxiv.org/abs/1111.0871

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR