A tighter bound for the number of words of minimum length in an automorphic orbit.
From MaRDI portal
Publication:855970
DOI10.1016/j.jalgebra.2006.03.038zbMath1112.20022arXivmath/0401269MaRDI QIDQ855970
Publication date: 7 December 2006
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0401269
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
Short, Highly Imprimitive Words Yield Hyperbolic One-Relator Groups, Growing words in the free group on two generators., Immersed cycles and the JSJ decomposition, The monomorphism problem in free groups., Search and witness problems in group theory, On an algorithm to decide whether a free group is a free factor of another
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.
- Counting words of minimum length in an automorphic orbit.
- 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