On several problems about automorphisms of the free group of rank two. (Q2518358): Difference between revisions

The author deals with three algorithmic problems concerning the automorphisms of a free group of rank two. The first concerns potentially positive words. A word \(u=u(x_1,\dots,x_n)\) of a free group \(F_n\) with free generators \(x_1,\dots,x_n\) is called positive if the exponents of \(x_i\) occurring in \(u\) are non negative and potentially positive if \(\varphi(u)\) is positive for some automorphism \(\varphi\) of \(F_n\). The author proves that there is an algorithm to decide whether or not a given word in \(F_2\) is potentially positive. The second problem deals with bounded translation equivalent elements. Two elements \(u\) and \(v\) in \(F_2\) are said to be boundedly translation equivalent if the ratio of the cyclic lengths of \(\varphi(u)\) and \(\varphi(v)\) is bounded, i.e., there is a \(c>0\) such that \(\frac 1c\leq\frac{\|\varphi(u)\|}{\|\varphi(v)\|}\leq c\) for every automorphism \(\varphi\) of \(F_2\). The author gives an algorithm to determine whether or not two given elements of \(F_2\) are boundedly translation equivalent. The third problem is to decide whether a finitely generated subgroup of \(F_2\) is the fixed point group of some automorphism of \(F_2\). The author provides an algorithm solving this problem. Thus this paper give affirmative solutions to problems F34a, F38c and F1b, respectively, of \textit{G. Baumslag, A. G. Myasnikov, V. Shpilrain}, [in Combinatorial and geometric group theory. Contemp. Math. 296, 1-38 (2002; Zbl 1065.20042), online version: \url{http://www.grouptheory.info}] restricted to the case of rank 2. Detailed statements of theorems are too lengthy to be included here. The treatment is purely combinatorial.