Genetic Algorithms for Word Problems in Partially Commutative Groups

Simple item page
dc.creatorCraven, Matthew
dc.date2004-05-20
dc.date2007-05-02
dc.date.accessioned2026-07-07T07:58:59Z
dc.date.available2026-07-07T07:58:59Z
dc.descriptionWe 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.
dc.description12 pages; several changes/improvements, publication version
dc.identifierhttps://arxiv.org/abs/math/0405396
dc.identifierhttp://arxiv.org/abs/math/0405396
dc.identifierLNCS 4446, Springer-Verlag (2007), 48--59
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/128204
dc.subjectGroup Theory
dc.subject08A50, 20F10
dc.titleGenetic Algorithms for Word Problems in Partially Commutative Groups
dc.typetext

Files

Collections

arXiv