Heuristics for the Whitehead Minimization Problem

DOI10.1080/10586458.2005.10128906zbMath1109.20021arXivmath/0604204OpenAlexW2040840696MaRDI QIDQ3418622

Robert M. Haralick, A. D. Myasnikov, Alexei G. Myasnikov

Publication date: 5 February 2007

Published in: Experimental Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

minimization problemprobabilistic algorithmsheuristic algorithmsfree groupsreduced wordsautomorphic orbitsWhitehead algorithmWhitehead methodelements of minimal lengthfree generating setsautomorphism problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Automorphisms of infinite groups (20E36) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Randomized algorithms (68W20)

Related Items

ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM ⋮ A hybrid search algorithm for the Whitehead minimization problem.