Presentations of finite simple groups: A computational approach

14Citations
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.

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free