pith. sign in

arxiv: math/0401349 · v2 · submitted 2004-01-26 · 🧮 math.GR

Twisted conjugacy in free groups and Makanin's question

classification 🧮 math.GR
keywords automorphismarbitraryfreeinnermakaninquestionaffirmativealgorithm
0
0 comments X
read the original abstract

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 $U$ and $V$ of a free group $F_n$ and an arbitrary automorphism $\phi \in Aut(F_n)$ the equation $\phi (X) U = V X$ solvable in $F_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 $F_n$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.