Fast Searching for Andrews-Curtis Trivializations
Bowman, R. Sean ; McCaul, Stephen B.
Experiment. Math., Tome 15 (2006) no. 1, p. 193-198 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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.
Publié le : 2006-05-15
Classification:  Andrews-Curtis conjecture,  computer search,  20-04,  20F05 
@article{1175789740,
     author = {Bowman, R. Sean and McCaul, Stephen B.},
     title = {Fast Searching for Andrews-Curtis Trivializations},
     journal = {Experiment. Math.},
     volume = {15},
     number = {1},
     year = {2006},
     pages = { 193-198},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1175789740}
}

Bowman, R. Sean; McCaul, Stephen B. Fast Searching for Andrews-Curtis Trivializations. Experiment. Math., Tome 15 (2006) no. 1, pp.  193-198. http://gdmltest.u-ga.fr/item/1175789740/