Results 231 to 240 of about 57,676 (259)
Some of the next articles are maybe not open access.
Computing with finite simple groups
1974Leech [9] and Birkhoff and Hall [1] are standard references to computational group theory. The lesser-known Petrick [13] contains many articles on symbolic manipulation and group-theoretic work including a description by Sims of techniques he has developed to compute with very large degree permutation groups. These ideas have been used by him [14] most
openaire +1 more source
1974
The group G is locally finite if each of its finitely generated subgroups is finite. Until rather recently the area of locally finite groups entirely belonged to the wilderness of counter-examples; and there absurdly wild behaviour is possible, indeed. What little progress has been made in cultivating some fringes of this wilderness is essentially due ...
openaire +1 more source
The group G is locally finite if each of its finitely generated subgroups is finite. Until rather recently the area of locally finite groups entirely belonged to the wilderness of counter-examples; and there absurdly wild behaviour is possible, indeed. What little progress has been made in cultivating some fringes of this wilderness is essentially due ...
openaire +1 more source
On periodic groups saturated by finite simple groups
Siberian Mathematical Journal, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
1983
I wish to thank the organizers of this symposium for inviting me to speak and enabling me to discuss some consequences of the classification of the finite simple groups.
openaire +1 more source
I wish to thank the organizers of this symposium for inviting me to speak and enabling me to discuss some consequences of the classification of the finite simple groups.
openaire +1 more source
Flag ? transitive finite simple groups
Archiv der Mathematik, 1986This paper is part of a programme aiming at the classification of all pairs (S,G) where S is a finite linear space (or a 2-(v,k,1) design) and G is a flag-transitive automorphism group of S (flag means incident point-line pair). As shown in a forthcoming paper by Buekenhout, Delandtsheer and Doyen, the group G is necessarily either of affine or of ...
openaire +3 more sources
On recognition of finite simple groups with connected prime graph
Siberian Mathematical Journal, 2009A V Vasil´Ev +2 more
exaly
An Adjacency Criterion for the Prime Graph of a Finite Simple Group
Algebra and Logic, 2005E P Vdovin, Vdovin E P
exaly
Probabilistic generation of finite simple groups, II
Journal of Algebra, 2008Robert M Guralnick, William M Kantor
exaly