Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

Currently displaying 1 – 2 of 2

Order by Relevance | Title | Year of publication

Symmetric groups and expanders.

Kassabov, Martin — 2005

Electronic Research Announcements of the American Mathematical Society [electronic only]

Presentations of finite simple groups: a computational approach

Robert Guralnick; William M. Kantor; Martin Kassabov; Alexander Lubotzky — 2011

Journal of the European Mathematical Society

All finite simple groups of Lie type of rank $n$ over a field of size $q$ , with the possible exception of the Ree groups $^{2} G_{2} (q)$ , have presentations with at most 49 relations and bit-length $O (𝚕𝚘𝚐 n + 𝚕𝚘𝚐 q)$ . Moreover, $A_{n}$ and $S_{n}$ have presentations with 3 generators; 7 relations and bit-length $O (𝚕𝚘𝚐 n)$ , while $𝚂𝙻 (n, q)$ has a presentation with 6 generators, 25 relations and bit-length $O (𝚕𝚘𝚐 n + 𝚕𝚘𝚐 q)$ .

Page 1

Download Results (CSV)