Classification of automorphic conjugacy classes in the free group on two generators.

From MaRDI portal
Publication:2944012




Abstract: We associate a finite directed graph with each equivalence class of words in F2 under operatornameAutF2, and we completely classify these graphs, giving a structural classification of the automorphic conjugacy classes of F2. This classification refines work of Khan and proves a conjecture of Myasnikov and Shpilrain on the number of minimal words in an automorphic conjugacy class whose minimal words have length n, which in turn implies a sharp upper bound on the running time of Whitehead's algorithm for determining whether two words in F2 are automorphic conjugates.









This page was built for publication: Classification of automorphic conjugacy classes in the free group on two generators.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944012)