Nice Efficient Presentions for all Small Simple Groups and their Covers

DOI10.1112/S1461157000001121zbMath1053.20013MaRDI QIDQ4827632

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

Publication date: 18 November 2004

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.lms.ac.uk/jcm/7/lms2003-027/

zbMATH Keywords

finite simple groups; covering groups; efficient presentations; coset enumeration; computer implementations; numbers of relators

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

20D08: Simple groups: sporadic groups

20F05: Generators, relations, and presentations of groups

20-04: Software, source code, etc. for problems pertaining to group theory

20D06: Simple groups: alternating groups and groups of Lie type

Related Items

Presentations of finite simple groups: a computational approach., Remarks on proficient groups., Fundamental groups of links of isolated singularities, Short presentations for alternating and symmetric groups, Presentations of finite simple groups: A quantitative approach

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Magma algebra system. I: The user language
• On the Efficiency of Some Finite Groups
• Efficient presentations for three simple groups
• Deficiency zero presentations for certain perfect groups
• The non-abelian simple groups g, |g| < 10⁵— presentations
• The efficiency of simple groups of order < 10⁵
• A Deficiency Zero Presentation for SL (2, p )
• Efficient Simple Groups
• Proving a group trivial made easy: A case study in coset enumeration
• Presentations of the Groups SL(2,m) And PSL(2,m)
• The Abstract Groups G m,n,p