Search arXivSearch

arXiv · 1306.5696

Dual automorphisms of free groups

Abstract

For any choice of a basis $\cal A$ the free group $F_N$ of finite rank $N \geq 2$ can be canonically identified with the set $F(\cal A)$ of reduced words in $\cal A\cup \cal A^{-1}$. However, such a word $w \in F(\cal A)$ admits a second interpretation, namely as cylinder $C^1_w \subset \partial F_N$. The subset of $\partial F_N$ defined by $C^1_w$ depends not only on the element of $F_N$ given by the word $w$, but also on the chosen basis $\cal A$. In particular one has in general, for $\Phi \in \Aut(F_N)$: $$\Phi(C^1_w) \neq C^1_{\Phi(w)}$$ Indeed, the image of a cylinder under an automorphism $\Phi \in \Aut(F_N)$ is in general not a cylinder, but a finite union of cylinders: $$\Phi (C^1_w)=C^{1}_U := \bigcup_{u_i \in U} C^1_{u_i}$$ In his thesis the first author has given an efficient algorithm and a formula how to determine such a (uniquely determined) finite {\em reduced} set $U = U(w) \subset F_N$. We use those to define the dual automorphism $\Phi_{\cal A}^*$ by setting $\Phi_{\cal A}^*(w) = U(w)$. \smallskip \noindent {\bf Theorem:} {\it For any $\Phi \in \Aut(F_N)$ there are at most 2N distinct finite subsets $U_i \subset F_N$ such that for any $w = y_1 ... y_r \in F_A$ there is one of them, say $U_{i(w)}$, with $$\Phi_{\cal A}^*(w) = \Phi(w) U_{i(w)}\, ,$$ and $U_{i(w)}$ depends only on the last letter $y_r \in \CA \cup \CA^{-1}$. Furthermore, the seize of each $U_{i}$ is bounded by $2^t$, where $t \geq 0$ is the number of Nielsen automorphisms in any decomposition of $\Phi$ as product of basis permutations, basis inversions and elementary Nielsen automorphisms.}

Explore related subjects

Keep this discovery

BibTeXRIS

Fedaa Ibrahim, Martin Lustig. 2013-06-24. Dual automorphisms of free groups. https://arxiv.org/abs/1306.5696

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