Counting words of minimum length in an automorphic orbit.

DOI10.1016/j.jalgebra.2006.04.012zbMath1100.20028arXivmath/0311410OpenAlexW2092598856MaRDI QIDQ2498873

Donghi Lee

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

zbMATH Keywords

free groupsword lengthsautomorphic orbitsWhitehead algorithmcyclic wordsWhitehead automorphisms

Mathematics Subject Classification ID

Automorphisms of infinite groups (20E36) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (5)

Average-case complexity of the Whitehead problem for free groups ⋮ A tighter bound for the number of words of minimum length in an automorphic orbit. ⋮ Growing words in the free group on two generators. ⋮ Short, Highly Imprimitive Words Yield Hyperbolic One-Relator Groups ⋮ 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

This page was built for publication: Counting words of minimum length in an automorphic orbit.