Présentation de certains couples fischériens de type classique
All finite simple groups of Lie type of rank over a field of size , with the possible exception of the Ree groups , have presentations with at most 49 relations and bit-length . Moreover, and have presentations with 3 generators; 7 relations and bit-length , while has a presentation with 6 generators, 25 relations and bit-length .
We first note that a result of Gowers on product-free sets in groups has an unexpected consequence: If is the minimal degree of a representation of the finite group , then for every subset of with we have . We use this to obtain improved versions of recent deep theorems of Helfgott and of Shalev concerning product decompositions of finite simple groups, with much simpler proofs. On the other hand, we prove a version of Jordan’s theorem which implies that if , then has a proper subgroup...
Let be a finite group and let be the set of prime divisors of for which . The Gruenberg-Kegel graph of , denoted , is defined as follows: its vertex set is and two different vertices and are adjacent by an edge if and only if contains an element of order . The degree of a vertex in is denoted by and the -tuple is said to be the degree pattern of . Moreover, if is the vertex set of a connected component of , then the largest -number which divides , is said to be an...
In this paper, we first find the set of orders of all elements in some special linear groups over the binary field. Then, we will prove the characterizability of the special linear group using only the set of its element orders.