Displaying 81 – 100 of 146

Showing per page

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 ) .

Product decompositions of quasirandom groups and a Jordan type theorem

Nikolay Nikolov, László Pyber (2011)

Journal of the European Mathematical Society

We first note that a result of Gowers on product-free sets in groups has an unexpected consequence: If k is the minimal degree of a representation of the finite group G , then for every subset B of G with | B | > | G | / k 1 / 3 we have B 3 = G . 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 k 2 , then G has a proper subgroup...

Several quantitative characterizations of some specific groups

A. Mohammadzadeh, Ali Reza Moghaddamfar (2017)

Commentationes Mathematicae Universitatis Carolinae

Let G be a finite group and let π ( G ) = { p 1 , p 2 , ... , p k } be the set of prime divisors of | G | for which p 1 < p 2 < < p k . The Gruenberg-Kegel graph of G , denoted GK ( G ) , is defined as follows: its vertex set is π ( G ) and two different vertices p i and p j are adjacent by an edge if and only if G contains an element of order p i p j . The degree of a vertex p i in GK ( G ) is denoted by d G ( p i ) and the k -tuple D ( G ) = ( d G ( p 1 ) , d G ( p 2 ) , ... , d G ( p k ) ) is said to be the degree pattern of G . Moreover, if ω π ( G ) is the vertex set of a connected component of GK ( G ) , then the largest ω -number which divides | G | , is said to be an...

Some results on the recognizability of the linear groups over the binary field

Mohammad Reza Darafsheh, Yaghoub Farjami, M. Khademi, Ali Reza Moghaddamfar (2005)

Commentationes Mathematicae Universitatis Carolinae

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 PSL ( 13 , 2 ) using only the set of its element orders.

Currently displaying 81 – 100 of 146