Proving a group trivial made easy: A case study in coset enumeration

Coset enumeration, based on the methods described by Todd and Coxeter, is one of the basic tools for investigating finitely presented groups. The process is not well understood, and various pathological presentations of, for example, the trivial group have been suggested as challenge problems. Here we consider one such family of presentations proposed by B.H. Neumann. We show that the problems are much easier than they first appear, albeit at the expense of considerable preliminary ‘experimentation’. This demonstrates how far the range of applicability of coset enumeration has improved.

[1]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[2]  G. Higman,et al.  A Finitely Generated Infinite Simple Group , 1951 .

[3]  J. A. Todd,et al.  A practical method for enumerating cosets of a finite abstract group , 1936 .

[4]  E. Robertson,et al.  Groups--St. Andrews 1981 , 1982 .

[5]  George Havas,et al.  Practical parallel coset enumeration , 1997 .

[6]  B. Neumann,et al.  An essay on free products of groups with amalgamations , 1954, Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences.

[7]  H. Brown,et al.  Computational Problems in Abstract Algebra , 1971 .

[8]  J. Neubüser,et al.  Groups – St Andrews 1981: An elementary introduction to coset table methods in computational group theory , 1982 .

[9]  George Havas,et al.  Experiments in coset enumeration , 2001 .

[10]  George Havas,et al.  Addendum to an elementary introduction to coset table methods in computational group theory , 1981 .

[11]  Gene Cooperman,et al.  Workshop on high performance computing and gigabit local area networks , 1997 .

[12]  Charles C. Sims,et al.  Computation with finitely presented groups , 1994, Encyclopedia of mathematics and its applications.

[13]  Donald E. Knuth,et al.  Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[14]  George Havas.  Coset enumeration strategies , 1991, ISSAC '91.

[15]  George Havas,et al.  Implementation and Analysis of the Todd-Coxeter Algorithm , 1973 .

[16]  John Leech.  Coset enumeration on digital computers , 1963 .