scientific article; zbMATH DE number 2144699
From MaRDI portal
Publication:4656977
zbMath1078.20035MaRDI QIDQ4656977
Publication date: 14 March 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
generatorsautomorphism groupsfree groupslength functionsWhitehead algorithmWhitehead graphsautomorphic conjugacy
Generators, relations, and presentations of groups (20F05) Automorphisms of infinite groups (20E36) Automorphism groups of groups (20F28) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (7)
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 ⋮ On an algorithm to decide whether a free group is a free factor of another ⋮ A hybrid search algorithm for the Whitehead minimization problem. ⋮ Counting words of minimum length in an automorphic orbit.
This page was built for publication:
