Classification of automorphic conjugacy classes in the free group on two generators.
From MaRDI portal
Publication:2944012
zbMATH Open1326.20026arXiv1307.8216MaRDI QIDQ2944012FDOQ2944012
Authors: Bobbe Cooper, Eric Rowland
Publication date: 7 September 2015
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.
Full work available at URL: https://arxiv.org/abs/1307.8216
Recommendations
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Free nonabelian groups (20E05) Conjugacy classes for groups (20E45) Combinatorics on words (68R15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cited In (6)
- Title not available (Why is that?)
- Short, Highly Imprimitive Words Yield Hyperbolic One-Relator Groups
- The free commutative automorphic $2$-generated loop of nilpotency class $3$
- Title not available (Why is that?)
- 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)