Whitehead method and Genetic Algorithms

Simple item page
dc.creatorMiasnikov, Alexei D.
dc.creatorMyasnikov, Alexei G.
dc.date2003-04-20
dc.date.accessioned2026-07-07T04:57:05Z
dc.date.available2026-07-07T04:57:05Z
dc.descriptionIn this paper we discuss a genetic version (GWA) of the Whitehead's algorithm, which is one of the basic algorithms in combinatorial group theory. It turns out that GWA is surprisingly fast and outperforms the standard Whitehead's algorithm in free groups of rank >= 5. Experimenting with GWA we collected an interesting numerical data that clarifies the time-complexity of the Whitehead's Problem in general. These experiments led us to several mathematical conjectures. If confirmed they will shed light on hidden mechanisms of Whitehead Method and geometry of automorphic orbits in free groups.
dc.description29 pages, 7 figures
dc.identifierhttps://arxiv.org/abs/math/0304283
dc.identifierhttp://arxiv.org/abs/math/0304283
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67151
dc.subjectGroup Theory
dc.subjectNeural and Evolutionary Computing
dc.subjectSymbolic Computation
dc.subject20F28, 68Q17, 68T05
dc.titleWhitehead method and Genetic Algorithms
dc.typetext

Files

Collections

arXiv