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 under , and we completely classify these graphs, giving a structural classification of the automorphic conjugacy classes of . 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 , which in turn implies a sharp upper bound on the running time of Whitehead's algorithm for determining whether two words in are automorphic conjugates.
Recommendations
Cited in
(6)- scientific article; zbMATH DE number 5320049 (Why is no real title available?)
- Short, Highly Imprimitive Words Yield Hyperbolic One-Relator Groups
- The free commutative automorphic $2$-generated loop of nilpotency class $3$
- scientific article; zbMATH DE number 2144699 (Why is no real title available?)
- Growing words in the free group on two generators.
- A tighter bound for the number of words of minimum length in an automorphic orbit.
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)