论文信息 - Whitehead method and Genetic Algorithms

Whitehead method and Genetic Algorithms

In this paper we discuss a genetic version (GWA) of the Whitehead's algorithm, which is one of the basic algorithms in combinatorial group theory. It turns out that GWA is surprisingly fast and outperforms the standard Whitehead's algorithm in free groups of rank >= 5. Experimenting with GWA we collected an interesting numerical data that clarifies the time-complexity of the Whitehead's Problem in general. These experiments led us to several mathematical conjectures. If confirmed they will shed light on hidden mechanisms of Whitehead Method and geometry of automorphic orbits in free groups.

Alexei G. Myasnikov | Alexei D. Miasnikov

[1] Alexei G. Myasnikov,et al. Automorphic orbits in free groups , 2002, math/0211157.

[2] David Thomas,et al. The Art in Computer Programming , 2001 .

[3] Ilya Kapovich,et al. Generic properties of Whitehead's Algorithm, stabilizers in Aut(Fk) and one-relator groups , 2003, ArXiv.

[4] Alexei D. Miasnikov,et al. Genetic Algorithms and the Andrews-Curtis Conjecture , 1999, Int. J. Algebra Comput..

[5] R. Lyndon,et al. Combinatorial Group Theory , 1977 .

[6] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[7] J. Nielsen,et al. Die Isomorphismengruppe der freien Gruppen , 1924 .

[8] J. Whitehead,et al. On Equivalent Sets of Elements in a Free Group , 1936 .

[9] Alexei G. Myasnikov,et al. Balanced presentations of the trivial group on two generators and the Andrews-Curtis conjecture , 2003, ArXiv.

[10] Alexandre V. Borovik,et al. Measuring sets in infinite groups , 2002, math/0204078.

[11] Badrul H. Khan. The Structure of Automorphic Conjugacy in the Free Group of Rank Two , 2004 .

[12] Colin R. Reeves,et al. Genetic Algorithms for the Operations Researcher , 1997, INFORMS J. Comput..