Genetic Algorithms for Word Problems in Partially Commutative Groups
群论
2007-05-23 v2
摘要
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.
引用
@article{arxiv.math/0405396,
title = {Genetic Algorithms for Word Problems in Partially Commutative Groups},
author = {Matthew Craven},
journal= {arXiv preprint arXiv:math/0405396},
year = {2007}
}
备注
12 pages; several changes/improvements, publication version