Presentations of finite simple groups: a computational approach.

From MaRDI portal




Abstract: All nonabelian finite simple groups of rank n over a field of size q, with the possible exception of the Ree groups 2G2(32e+1), have presentations with at most 80 relations and bit-length O(logn+logq). Moreover, An and Sn have presentations with 3 generators, 7 relations and bit-length O(logn), while SL(n,q) has a presentation with 7 generators, 25 relations and bit-length O(logn+logq).



Cites work



Describes a project that uses

Uses Software





This page was built for publication: Presentations of finite simple groups: a computational approach.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q621854)