PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
December 15, 2010Journal of the European Mathematical Society25 citationsOpen Access

Presentations of finite simple groups: a computational approach

RGRobert M. GuralnickWKWilliam M. KantorMKMartin Kassabov

Key Points

Key points are not available for this paper at this time.

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 2G₂ (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 bit-length O (log n), while SL (n, q) has a presentation with 6 generators, 25 relations and bit-length O (log n + log q).

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Guralnick et al. (2010) studied this question.

synapsesocial.com/papers/6a154cf45c7c86e0359f4ce2https://doi.org/10.4171/jems/257
Ask AI
Helpful
Bookmark
Share
View Full Paper