On the Efficiency of the Simple Groups of Order Less Than a Million and Their Covers

DOI10.1080/10586458.2007.10129006zbMath1133.20015OpenAlexW2137866876MaRDI QIDQ5449057

Colin M. Ramsay, George Havas, Colin M. Campbell, Edmund F. Robertson

Publication date: 10 March 2008

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.em/1204928534

zbMATH Keywords

finite simple groupscovering groupsefficient presentationscoset enumerationcomputer implementations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Simple groups: sporadic groups (20D08) Generators, relations, and presentations of groups (20F05) Finite simple groups and their classification (20D05) Software, source code, etc. for problems pertaining to group theory (20-04) Simple groups: alternating groups and groups of Lie type (20D06)

Related Items (4)

Presentations of finite simple groups: a computational approach. ⋮ Remarks on proficient groups. ⋮ On Efficient Presentations of the Groups PSL $(2, m)$ ⋮ On presentations for unitary groups

Uses Software

• GAP

This page was built for publication: On the Efficiency of the Simple Groups of Order Less Than a Million and Their Covers