All simple groups with order from 1 million to 5 million are efficient

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

There is much interest in finding short presentations for the finite simple groups. Indeed it has been suggested that all these groups are efficient in a technical sense. In previous papers we produced nice efficient presentations for all except one of the simple groups with order less than one million. Here we show that all simple groups with order between 1 million and 5 million are efficient by giving efficient presentations for all of them. Apart from some linear groups these results are all new. We also show that some covering groups and some larger simple groups are efficient. We make substantial use of systems for computational group theory and, in particular, of computer implementations of coset enumeration to find and verify our presentations.
Original languageEnglish
Pages (from-to)17–30
Number of pages14
JournalInternational Journal of Group Theory
Volume3
Issue number1
DOIs
Publication statusPublished - Mar 2014

Keywords

  • Efficient presentations
  • Simple groups
  • Coset enumeration

Fingerprint

Dive into the research topics of 'All simple groups with order from 1 million to 5 million are efficient'. Together they form a unique fingerprint.

Cite this