Genetic algorithms and the Andrews-Curtis conjecture
| dc.creator | Miasnikov, Alexei D. | |
| dc.date | 2003-04-21 | |
| dc.date.accessioned | 2026-07-07T04:57:09Z | |
| dc.date.available | 2026-07-07T04:57:09Z | |
| dc.description | The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be transformed into the trivial presentation by a finite sequence of "elementary transformations" which are Nielsen transformations together with an arbitrary conjugation of a relator. It is believed that the Andrews-Curtis conjecture is false; however, not so many possible counterexamples are known. It is not a trivial matter to verify whether the conjecture holds for a given balanced presentation or not. The purpose of this paper is to describe some non-deterministic methods, called Genetic Algorithms, designed to test the validity of the Andrews-Curtis conjecture. Using such algorithm we have been able to prove that all known (to us) balanced presentations of the trivial group where the total length of the relators is at most 12 satisfy the conjecture. In particular, the Andrews-Curtis conjecture holds for the presentation <x,y|x y x = y x y, x^2 = y^3> which was one of the well known potential counterexamples. | |
| dc.description | 19 pages | |
| dc.identifier | https://arxiv.org/abs/math/0304306 | |
| dc.identifier | http://arxiv.org/abs/math/0304306 | |
| dc.identifier | International Journal of Algebra and Computation, Vol. 9 No. 6, (1999) 671-686 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/67170 | |
| dc.subject | Group Theory | |
| dc.subject | Neural and Evolutionary Computing | |
| dc.subject | Symbolic Computation | |
| dc.subject | 20E05, 20F05, 68T05 (Primary) 57M05,57M20 | |
| dc.title | Genetic algorithms and the Andrews-Curtis conjecture | |
| dc.type | text |