GENETIC ALGORITHMS AND THE ANDREWS–CURTIS CONJECTURE

DOI10.1142/S0218196799000370zbMath0949.20022arXivmath/0304306OpenAlexW2059812428WikidataQ122956861 ScholiaQ122956861MaRDI QIDQ4484940

No author found.

Publication date: 3 December 2000

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0304306

zbMATH Keywords

genetic algorithmsbalanced presentationsAndrews-Curtis conjectureNielsen transformations

Mathematics Subject Classification ID

Related Items (9)

Andrews–Curtis groups and the Andrews–Curtis conjecture ⋮ A family of Andrews-Curtis trivializations via 4-manifold trisections ⋮ On Conjectures of Andrews and Curtis ⋮ Balanced finite presentations of the trivial group ⋮ FITNESS LANDSCAPES AND THE ANDREWS–CURTIS CONJECTURE ⋮ Irreducible Cyclic Presentations of the Trivial Group ⋮ THE ANDREWS–CURTIS CONJECTURE AND BLACK BOX GROUPS ⋮ BREADTH-FIRST SEARCH AND THE ANDREWS–CURTIS CONJECTURE ⋮ Conjugacy search problem and the Andrews-Curtis conjecture

Cites Work

• A potential smooth counterexample in dimension 4 to the Poincaré conjecture, the Schoenflies conjecture, and the Andrews-Curtis conjecture
• Balanced Presentations of the Trivial Group
• Remarks on Groups of Order 1

This page was built for publication: GENETIC ALGORITHMS AND THE ANDREWS–CURTIS CONJECTURE