Counting words of minimum length in an automorphic orbit.
From MaRDI portal
Publication:2498873
DOI10.1016/j.jalgebra.2006.04.012zbMath1100.20028arXivmath/0311410MaRDI QIDQ2498873
Publication date: 16 August 2006
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0311410
free groups; word lengths; automorphic orbits; Whitehead algorithm; cyclic words; Whitehead automorphisms
20E36: Automorphisms of infinite groups
20E05: Free nonabelian groups
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
Related Items
Average-case complexity of the Whitehead problem for free groups, Short, Highly Imprimitive Words Yield Hyperbolic One-Relator Groups, Growing words in the free group on two generators., A tighter bound for the number of words of minimum length in an automorphic orbit., Search and witness problems in group theory
Cites Work
- Unnamed Item
- Unnamed Item
- Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
- Automorphic orbits in free groups.
- On equivalent sets of elements in a free group
- A Presentation for the Automorphism Group of a Free Group of Finite Rank
- Equivalence of Elements Under Automorphisms of a Free Group