Presentations of finite simple groups: A computational approach

R. M. Guralnick, W. M. Kantor, M. Kassabov, A. Lubotzky

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

All finite simple groups of Lie type of rank n over a field of size q, with the possible exception of the Ree groups 2G2(q), have presentations with at most 49 relations and bit-length O(log n + log q). Moreover, An and Sn have presentations with 3 generators; 7 relations and bitlength O(log n), while SL(n; q) has a presentation with 6 generators, 25 relations and bit-length O(log n + log q).

Original languageEnglish
Pages (from-to)391-458
Number of pages68
JournalJournal of the European Mathematical Society
Volume13
Issue number2
DOIs
StatePublished - 2011

Fingerprint

Dive into the research topics of 'Presentations of finite simple groups: A computational approach'. Together they form a unique fingerprint.

Cite this