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

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1529093
Language Label Description Also known as
default for all languages
No label defined
    English
    Proving a group trivial made easy: A case study in coset enumeration
    scientific article; zbMATH DE number 1529093

      Statements

      Proving a group trivial made easy: A case study in coset enumeration (English)
      0 references
      0 references
      0 references
      6 May 2002
      0 references
      presentations
      0 references
      Todd-Coxeter process
      0 references
      coset enumeration
      0 references
      B. H. Neumann had earlier noted that the presentation \[ E_1=\langle r,s,t\mid t^{-1}rtr^{-1}r^{-1}, r^{-1}srs^{-1}s^{-1}, s^{-1}tst^{-1}t^{-1}\rangle \] for the trivial group was difficult for early computer implementations of the Todd-Coxeter process to solve, although modern implementations solved it. Neumann iterated this presentation for the trivial group by making each time certain replacements for \(r\), \(s\) and \(t\); thus obtaining on the first iteration the group \(E_2\), which as the authors describe it, beats all programmes on all existing computers. However, they prove that \(E_2\) is trivial by coset enumeration. The coset enumeration implementation they used was advanced coset enumerator (ACE) given by the first author then enhanced by both of them in two previous papers. The enumeration was performed on an SGI Origin 2000 computer.
      0 references

      Identifiers