Heuristics for The Whitehead Minimization Problem

Details Heuristics for The Whitehead Minimization Problem Heuristics for The Whitehead Minimization Problem

2006-04-09

arxiv.org/abs/math/0604204v1

J. Experimental Mathematics. Vol. 14, No. 1, (2005), 7-14

Mathematics

Group Theory

Scientific paper

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 algorithm. The mere fact that these strategies work in practice leads to several interesting mathematical conjectures. In particular, we conjecture that the length of most non-minimal elements in a free group can be reduced by a Nielsen automorphism which can be identified by inspecting the structure of the corresponding Whitehead Graph.

Affiliated with

Also associated with

No associations

Rating

Heuristics for The Whitehead Minimization Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Heuristics for The Whitehead Minimization Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heuristics for The Whitehead Minimization Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-267769