Displaying 761 – 780 of 1356

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

Prime divisors of conjugacy class lengths in finite groups

Carlo Casolo (1991)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

We show that in a finite group G which is p -nilpotent for at most one prime dividing its order, there exists an element whose conjugacy class length is divisible by more than half of the primes dividing G / Z G .

Principalization algorithm via class group structure

Daniel C. Mayer (2014)

Journal de Théorie des Nombres de Bordeaux

For an algebraic number field K with 3 -class group Cl 3 ( K ) of type ( 3 , 3 ) , the structure of the 3 -class groups Cl 3 ( N i ) of the four unramified cyclic cubic extension fields N i , 1 i 4 , of K is calculated with the aid of presentations for the metabelian Galois group G 3 2 ( K ) = Gal ( F 3 2 ( K ) | K ) of the second Hilbert 3 -class field F 3 2 ( K ) of K . In the case of a quadratic base field K = ( D ) it is shown that the structure of the 3 -class groups of the four S 3 -fields N 1 , ... , N 4 frequently determines the type of principalization of the 3 -class group of K in N 1 , ... , N 4 . This provides...

Probability that an element of a finite group has a square root

M. S. Lucido, M. R. Pournaki (2008)

Colloquium Mathematicae

Let G be a finite group of even order. We give some bounds for the probability p(G) that a randomly chosen element in G has a square root. In particular, we prove that p(G) ≤ 1 - ⌊√|G|⌋/|G|. Moreover, we show that if the Sylow 2-subgroup of G is not a proper normal elementary abelian subgroup of G, then p(G) ≤ 1 - 1/√|G|. Both of these bounds are best possible upper bounds for p(G), depending only on the order of G.

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

Currently displaying 761 – 780 of 1356