Advertisement

Genetic Algorithms for Word Problems in Partially Commutative Groups

  • Matthew J. Craven
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4446)

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.

Keywords

Genetic Algorithm Commutative Group Normal Form Current Population Word Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Booth, R.F., Bormotov, D.Y., Borovik, A.V.: Genetic Algorithms and Equations in Free Groups and Semigroups. Contemp. Math. 349, 63–80 (2004)MathSciNetGoogle Scholar
  2. 2.
    Borovik, A.V., Esyp, E.S., Kazatchkov, I.V., Remeslennikov, V.N.: Divisibility Theory and Complexity of Algorithms for Free Partially Commutative Groups. Contemp. Math. 378 (Groups, Languages, Algorithms) (2005)Google Scholar
  3. 3.
    Bremermann, H.J.: Optimization Through Evolution and Recombination. In: Yovits, M.C., et al. (ed.) Self-Organizing Systems, pp. 93–106. Spartan Books, Washington (1962)Google Scholar
  4. 4.
    Holland, J.: Adaptation in Natural and Artificial Systems (5th printing). MIT Press, Cambridge (1998) Google Scholar
  5. 5.
    Ko, K.-H.: Braid Group and Cryptography. 19th SECANTS, Oxford (2002)Google Scholar
  6. 6.
    Knuth, D., Bendix, P.: Simple Word Problems in Universal Algebra, Computational Problems in Abstract Algebras. In: Leech, J. (ed.), pp. 263–297. Pergamon Press, Oxford (1970)Google Scholar
  7. 7.
    Miasnikov, A.D.: Genetic Algorithms and the Andrews-Curtis Conjecture. Internat. J. Algebra Comput. 9(6), 671–686 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Miasnikov, A.D., Myasnikov, A.G.: Whitehead Method and Genetic Algorithms. Contemp. Math. 349, 89–114 (2004)MathSciNetGoogle Scholar
  9. 9.
    Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Berlin (1996)zbMATHGoogle Scholar
  10. 10.
    VanWyk, L.: Graph Groups are Biautomatic. J. Pure Appl. Algebra 94(3), 341–352 (1994)CrossRefMathSciNetGoogle Scholar
  11. 11.
    Vershik, A., Nechaev, S., Bikbov, R.: Statistical Properties of Braid Groups in Locally Free Approximation. Comm. Math. Phys. 212, 59–128 (2000)CrossRefMathSciNetGoogle Scholar
  12. 12.
    Wrathall, C.: The Word Problem for Free Partially Commutative Groups. J. Symbolic Comp. 6, 99–104 (1988)zbMATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    Wrathall, C.: Free partially commutative groups, Combinatorics, Computing and Complexity (Tianjing and Beijing, 1988). In: Math. Appl. (Chin. Ser. 1), pp. 195–216, Kluwer Acad. Publ., Dordrecht (1989)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Matthew J. Craven
    • 1
  1. 1.Mathematical Sciences, University of Exeter, North Park Road, Exeter EX4 4QFUK

Personalised recommendations