A hybrid search algorithm for the Whitehead minimization problem.

DOI10.1016/j.jsc.2006.04.001zbMath1124.20015arXivmath/0604206OpenAlexW2161424070MaRDI QIDQ2457368

A. D. Myasnikov, Robert M. Haralick

Publication date: 23 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

free groupsheuristic search algorithmsautomorphic orbitselements of minimal lengthautomorphism problemhybrid search algorithmslength-reducing automorphismsWhitehead minimization 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) Software, source code, etc. for problems pertaining to group theory (20-04)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
• The subadditive ergodic theorem and generic stretching factors for free group automorphisms.
• What does a basis of F(a,b) look like?
• Automorphic orbits in free groups.
• On equivalent sets of elements in a free group
• Heuristics for the Whitehead Minimization Problem
• ON SYSTEMS OF EQUATIONS IN A FREE GROUP
• A public key system with signature and master key functions
• Clusters, Currents, and Whitehead's Algorithm
• Artificial Intelligence and Symbolic Computation

This page was built for publication: A hybrid search algorithm for the Whitehead minimization problem.