Dual automorphisms of free groups

From MaRDI portal





Abstract: For any choice of a basis calA the free group FN of finite rank Ngeq2 can be canonically identified with the set F(calA) of reduced words in calAcupcalA1. However, such a word winF(calA) admits a second interpretation, namely as cylinder Cw1subsetpartialFN. The subset of partialFN defined by Cw1 depends not only on the element of FN given by the word w, but also on the chosen basis calA. In particular one has in general, for PhiinAut(FN): Phi(C^1_w)

eq C^1_{Phi(w)} Indeed, the image of a cylinder under an automorphism PhiinAut(FN) is in general not a cylinder, but a finite union of cylinders: Phi (C^1_w)=C^{1}_U := �igcup_{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)subsetFN. We use those to define the dual automorphism PhicalA by setting PhicalA(w)=U(w). smallskip

oindent {�f Theorem:} {it For any PhiinAut(FN) there are at most 2N distinct finite subsets UisubsetFN such that for any w=y1...yrinFA there is one of them, say Ui(w), with Phi_{cal A}^*(w) = Phi(w) U_{i(w)}, , and Ui(w) depends only on the last letter yrinCAcupCA1. Furthermore, the seize of each Ui is bounded by 2t, where tgeq0 is the number of Nielsen automorphisms in any decomposition of Phi as product of basis permutations, basis inversions and elementary Nielsen automorphisms.}












This page was built for publication: Dual automorphisms of free groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6242882)