BREADTH-FIRST SEARCH AND THE ANDREWS–CURTIS CONJECTURE

DOI10.1142/S0218196703001365zbMath1059.20029WikidataQ123001429 ScholiaQ123001429MaRDI QIDQ3043628

George Havas, Colin M. Ramsay

Publication date: 6 August 2004

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

zbMATH Keywords

genetic algorithmsbalanced presentationsAndrews-Curtis conjecturetrivial groupcomputer generated proofs

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Fundamental group, presentations, free differential calculus (57M05) Free nonabelian groups (20E05) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (9)

Andrews–Curtis groups and the Andrews–Curtis conjecture ⋮ On Andrews–Curtis conjectures for soluble groups ⋮ 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 ⋮ On presentations for unitary groups ⋮ Conjugacy search problem and the Andrews-Curtis conjecture ⋮ ONE-SIDE NIELSEN TRANSFORMATIONS IN FREE GROUPS

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
• GENETIC ALGORITHMS AND THE ANDREWS–CURTIS CONJECTURE
• Recalcitrance in groups
• Unnamed Item
• Unnamed Item

This page was built for publication: BREADTH-FIRST SEARCH AND THE ANDREWS–CURTIS CONJECTURE