Twisted conjugacy in free groups and Makanin's question
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 Fn and an arbitrary automorphism φ ∈ Aut(Fn) the equation φ (X) U = V X solvable in Fn? 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 Fn.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.