University of IsfahanInternational Journal of Group Theory2251-76503120140301All simple groups with order from 1 million to 5 million are efficient1730298410.22108/ijgt.2014.2984ENColin M.CampbellSchool of Mathematics and Statistics, University of St AndrewsGeorgeHavasCentre for Discrete Mathematics and Computing, School of Information Technology and Electrical Engineering,
The University of QueenslandColinRamsayCentre for Discrete Mathematics and Computing, School of Information Technology and Electrical Engineering,
The University of QueenslandEdmund F.RobertsonSchool of Mathematics and Statistics, University of St AndrewsJournal Article20130304There 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.https://ijgt.ui.ac.ir/article_2984_1966833cf149fe7e096cd9874914cd5c.pdf