Showing math.GRShow all
3 papers · 1 filter
math.GR2006
A Hybrid Search Algorithm for the Whitehead Minimization Problem
A. D. Myasnikov, R. M Haralick
The Whitehead Minimization problem is a problem of finding elements of the minimal length in the automorphic orbit of a given element of a free group. The classical algorithm of Wh…
math.GR2006
Pattern Recognition Approaches to Solving Combinatorial Problems in Free Groups
Robert M. Haralick, Alexei D. Miasnikov, Alexei G. Myasnikov
We review some basic methodologies from pattern recognition that can be applied to helping solve combinatorial problems in free group theory. We illustrate how this works with reco…
math.GR2006
Heuristics for The Whitehead Minimization Problem
R. M. Haralick, A. D. Miasnikov, A. G. Myasnikov
In this paper we discuss several heuristic strategies which allow one to solve the Whitehead's minimization problem much faster (on most inputs) than the classical Whitehead algori…