加载中…
We discuss the following question of G. Makanin from ``Kourovka notebook’': does there exist an algorithm to determine is for an arbitrary pair of words and of a free group and an arbitrary automorphism $\phi \in Aut(F_n)\phi (X) U = V XF_n$? We give the affirmative answer in the case when an automorphism is virtually inner, i.e. some its non-zero power is an inner automorphism of .

生成讲解博客的中文版本

生成AI智能校验的中文版本