ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM

DOI10.1142/S0218196707004244zbMath1149.20024arXivmath/0608779MaRDI QIDQ3502844

Enric Ventura Capell, Pascal Weil, Abdó Roig

Publication date: 20 May 2008

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0608779

zbMATH Keywords

algorithms; finitely generated subgroups; automorphisms; free groups; automorphic orbits; Whitehead minimization problem

Mathematics Subject Classification ID

20F28: Automorphism groups of groups

20E05: Free nonabelian groups

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

Related Items

Statistical properties of subgroups of free groups, Computing fixed closures in free groups., The monomorphism problem in free groups., Volume equivalence of subgroups of free groups., READING OFF KUROSH DECOMPOSITIONS, AUTOMORPHIC ORBITS IN FREE GROUPS: WORDS VERSUS SUBGROUPS, Subgroups of free groups and primitive elements

Cites Work

• Unnamed Item
• Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
• Topology of finite graphs
• On submodular function minimization
• An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem
• Automorphism group of a free group: Centralizers and stabilizers
• Automorphic orbits in free groups.
• Stallings foldings and subgroups of free groups
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• On equivalent sets of elements in a free group
• A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
• Maximal Flow Through a Network
• On Whitehead’s algorithm
• Heuristics for the Whitehead Minimization Problem
• A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS