SearcharxivSearch

arXiv · math/0701441

On certain questions of the free group automorphisms theory

Abstract

Certain subgroups of the groups $Aut(F_n)$ of automorphisms of a free group $F_n$ are considered. Comparing Alexander polynomials of two poly-free groups $Cb_4^+$ and $P_4$ we prove that these groups are not isomorphic, despite the fact that they have a lot of common properties. This answers the question of Cohen-Pakianathan-Vershinin-Wu from \cite{CVW}. The questions of linearity of subgroups of $Aut(F_n)$ are considered. As an application of the properties of poison groups in the sense of Formanek and Procesi, we show that the groups of the type $Aut(G*\mathbb Z)$ for certain groups $G$ and the subgroup of $IA$-automorphisms $IA(F_n)\subset Aut(F_n)$ are not linear for $n\geq 3$. This generalizes the recent result of Pettet that $IA(F_n)$ are not linear for $n\geq 5$.

Explore related subjects

Keep this discovery

BibTeXRIS

Valeriy G. Bardakov, Roman Mikhailov. 2007-01-16. On certain questions of the free group automorphisms theory. https://arxiv.org/abs/math/0701441

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