Fast Searching for Andrews-Curtis Trivializations

A high-performance computer program for searching a tree of words in the group generated by Andrews-Curtis transformations is presented. The program enumerates words in this group using a disk-based hash table to store words already seen. We discuss several issues that affect the performance of the...

Full description

Saved in:
Bibliographic Details
Published in:Experimental mathematics 2006-01, Vol.15 (2), p.193-197, Article 193
Main Authors: Bowman, R. Sean, McCaul, Stephen B.
Format: Article
Language:English
Subjects:
20-04
20-04, 20F05
20F05
Andrews-Curtis conjecture
computer search
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A high-performance computer program for searching a tree of words in the group generated by Andrews-Curtis transformations is presented. The program enumerates words in this group using a disk-based hash table to store words already seen. We discuss several issues that affect the performance of the program and examine the growth of the size of the Cayley graph being searched.
ISSN:1058-6458
1944-950X
DOI:10.1080/10586458.2006.10128962