Presentations of finite simple groups: a computational approach

Simple item page
dc.creatorGuralnick, R. M.
dc.creatorKantor, W. M.
dc.creatorKassabov, M.
dc.creatorLubotzky, A.
dc.date2008-04-09
dc.date.accessioned2026-07-07T09:31:17Z
dc.date.available2026-07-07T09:31:17Z
dc.descriptionAll nonabelian finite simple groups of rank $n$ over a field of size $q$, with the possible exception of the Ree groups $^2G_2(3^{2e+1})$, have presentations with at most $80 $ relations and bit-length $O(\log n +\log q)$. Moreover, $A_n$ and $S_n$ have presentations with 3 generators$,$ 7 relations and bit-length $O(\log n)$, while $\SL(n,q)$ has a presentation with 7 generators, $2 5$ relations and bit-length $O(\log n +\log q)$.
dc.description48 pages
dc.identifierhttps://arxiv.org/abs/0804.1396
dc.identifierhttp://arxiv.org/abs/0804.1396
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/158402
dc.subjectGroup Theory
dc.subjectCombinatorics
dc.subject20D06, 20F05 (Primary); 20J06 (Secondary)
dc.titlePresentations of finite simple groups: a computational approach
dc.typetext

Files

Collections

arXiv