How many elements are needed to generate a finite group with good probability?

Israel Journal of Mathematics

Volumn 132, Issue , 2002, Pages 29-44

  Detomi, Eloisa ^a   Lucchini, Andrea ^a   Morini, Fiorenza ^a  

^a UNIVERSITY OF BRESCIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036990911     PISSN: 00212172     EISSN: 15658511     Source Type: Journal    
DOI: 10.1007/BF02784504     Document Type: Article

References (8)

1. M. Aschbacher and R. Guralnick, Some applications of the first cohomology group, Journal of Algebra 90 (1984), 446-460.
2. P. J. Cameron, R. Solomon and A. Turull, Chains of subgroups in symmetric groups, Journal of Algebra 127 (1989), 340-352.
3. W. Gaschütz, Zu einem von B.H. und H. Neumann gestellten Problem, Mathematische Nachrichten 14 (1955), 249-252.
4. W. Gaschütz, Die Eulersche Funktion endlicher auflösbarer Gruppen, Illinois Journal of Mathematics 3 (1959), 469-476.
5. W. Kantor and A. Lubotzky, The probability of generating a finite classical group, Geometriae Dedicata 36 (1990), 67-87.
6. L.G. Kovács and G.R. Robinson, Generating finite completely reducible linear groups, Proceedings of the American Mathematical Society 112 (1991), 357-364.
7. A. Lucchini, F. Menegazzo and M. Morigi, On the number of generators and composition length of finite linear groups, Journal of Algebra 243 (2001), 427-447.
8. I. Pak, On the probability of generating a finite group, Preprint, 2000.