Dual automorphisms of free groups
Abstract
For any choice of a basis the free group of finite rank can be canonically identified with the set of reduced words in . However, such a word admits a second interpretation, namely as cylinder . The subset of defined by depends not only on the element of given by the word , but also on the chosen basis . In particular one has in general, for : Indeed, the image of a cylinder under an automorphism is in general not a cylinder, but a finite union of cylinders: 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 . We use those to define the dual automorphism by setting . \smallskip \noindent {\bf Theorem:} {\it For any there are at most 2N distinct finite subsets such that for any there is one of them, say , with and depends only on the last letter . Furthermore, the seize of each is bounded by , where is the number of Nielsen automorphisms in any decomposition of as product of basis permutations, basis inversions and elementary Nielsen automorphisms.}
Keywords
Cite
@article{arxiv.1306.5696,
title = {Dual automorphisms of free groups},
author = {Fedaa Ibrahim and Martin Lustig},
journal= {arXiv preprint arXiv:1306.5696},
year = {2013}
}