Open Access
Translator Disclaimer
2006 Fast Searching for Andrews-Curtis Trivializations
R. Sean Bowman, Stephen B. McCaul
Experiment. Math. 15(2): 193-198 (2006).

Abstract

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.

Citation

Download Citation

R. Sean Bowman. Stephen B. McCaul. "Fast Searching for Andrews-Curtis Trivializations." Experiment. Math. 15 (2) 193 - 198, 2006.

Information

Published: 2006
First available in Project Euclid: 5 April 2007

zbMATH: 1112.20027
MathSciNet: MR2253006

Subjects:
Primary: 20-04 , 20F05

Keywords: Andrews-Curtis conjecture , computer search

Rights: Copyright © 2006 A K Peters, Ltd.

JOURNAL ARTICLE
6 PAGES


SHARE
Vol.15 • No. 2 • 2006
Back to Top