Genetic Algorithms for Word Problems in Partially Commutative Groups
arXiv:math/0405396
Abstract
We describe an implementation of a genetic algorithm on partially commutative groups and apply it to the double coset search problem on a subclass of groups. This transforms a combinatorial group theory problem to a problem of combinatorial optimisation. We obtain a method applicable to a wide range of problems and give results which indicate good behaviour of the genetic algorithm, hinting at the presence of a new deterministic solution and a framework for further results.
12 pages; several changes/improvements, publication version