No label defined (Q4677704)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 2167520
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 2167520

      Statements

      12 May 2005
      0 references
      conjugating automorphism groups
      0 references
      bases-conjugating automorphism groups
      0 references
      occurrence problem in finitely generated subgroups
      0 references
      factorizations of groups into semidirect products
      0 references
      free groups
      0 references
      The author examines the automorphism group \(\Aut(F_n)\) of a free group \(F_n\) of rank \(n\geq 2\) on free generators \(x_1,x_2,\dots,x_n\). It is known that \(\Aut(F_2)\) can be built from cyclic subgroups using free and semidirect products. The question remains open as to whether this result can be extended to the case \(n>2\). Every automorphism of \(\Aut(F_n)\) sending generator \(x_i\) to the element \(f_i^{-1}x_{\pi(i)}f_i\), where \(f_i\in F_n\) and \(\pi\) is some permutation in the symmetric group \(S_n\), is called a conjugating automorphism. The conjugating automorphism group is denoted by \(C_n\). The set of automorphisms for which \(\pi\) is the identity permutation forms the basis-conjugating automorphism group, denoted \(Cb_n\). It is proved that \(Cb_n\) can be factored into a semidirect product of some groups. As a consequence the author obtains a normal form for words in \(C_n\). For \(n\geq 4\), \(C_n\) and \(Cb_n\) have undecidable occurrence problem in finitely generated subgroups. It is also shown that \(C_n\), \(n\geq 2\), is generated by at most four elements, and its respective genetic code is found, and it is shown that \(Cb_n\), \(n\geq 2\), has no proper verbal subgroups of finite width.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references