SearcharxivSearch

arXiv · 2203.08868

CTs for free products

Abstract

The fundamental group of a finite graph of groups with trivial edge groups is a free product. We are interested in those outer automorphisms of such a free product that permute the conjugacy classes of the vertex groups. We show that in particular cases of interest, such as where vertex groups are themselves finite free products of finite and cyclic groups, given such an outer automorphism, after passing to a positive power, the outer automorphism is represented by a particularly nice kind of relative train track map called a CT. CTs were first introduced by Feighn and Handel for outer automorphisms of free groups. We develop the theory of attracting laminations for and principal automorphisms of free products. We prove that outer automorphisms of free products satisfy an index inequality reminiscent of a result of Gaboriau, Jaeger, Levitt and Lustig and sharpening a result of Martino. Finally, we prove a result reminiscent of a theorem of Culler on the fixed subgroup of an automorphism of a free product whose outer class has finite order.

Explore related subjects

Keep this discovery

BibTeXRIS

Rylee Alanza Lyman. 2022-03-16. CTs for free products. https://arxiv.org/abs/2203.08868

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