Presentations of finite simple groups: A computational approach

15Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

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). © 2011 European Mathematical Society.

References Powered by Scopus

Theorie der Zöpfe

396Citations
N/AReaders
Get full text

The probability of generating the symmetric group

161Citations
N/AReaders
Get full text

ON THE COMPLEXITY OF MATRIX GROUP PROBLEMS I.

150Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Notes on gauging noninvertible symmetries. Part I. Multiplicity-free cases

16Citations
N/AReaders
Get full text

Presentations for the higher-dimensional thompson groups <inf>n</inf>V

16Citations
N/AReaders
Get full text

Groups of Ree type in characteristic 3 acting on polytopes

5Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Guralnick, R. M., Kantor, W. M., Kassabov, M., & Lubotzky, A. (2011). Presentations of finite simple groups: A computational approach. Journal of the European Mathematical Society, 13(2), 391–458. https://doi.org/10.4171/JEMS/257

Readers over time

‘09‘12‘17‘18‘19‘2000.751.52.253

Readers' Seniority

Tooltip

Professor / Associate Prof. 4

50%

PhD / Post grad / Masters / Doc 2

25%

Researcher 2

25%

Readers' Discipline

Tooltip

Mathematics 9

100%

Save time finding and organizing research with Mendeley

Sign up for free
0