The representation theory of finite groups has seen rapid growth in recent years with the
development of efficient algorithms and computer algebra systems. This is the first book to …

Let G be a permutation group acting on a set Ω. A subset of Ω is a base for G if its pointwise
stabilizer in G is trivial. We write b (G) for the minimal size of a base for G. We determine the …

The classification of the maximal subgroups of the Monster $\mathbf {M} $ is a long-standing
problem in finite group theory. According to the literature, the classification is complete apart …

Automorphism group computation and isomorphism testing in finite groups - ScienceDirect Skip to
main contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

We describe an algorithm to compute a composition tree for a matrix group defined over a
finite field, and show how to use the associated structure to carry out computations with such …

1.1 Introduction. Many of the sporadic simple groups were originally constructed on a
computer, for example as groups of matrices or as groups of permutations. However the …

Regular orbits and the V)-problem Page 217 Regular orbits and the V)-problem Christoph
Köhler and Herbert Pahlings Abstract. In this paper all finite quasisimple groups having no …

Towards effective algorithms for linear groups Page 171 Towards effective algorithms for linear
groups EA O’Brien Abstract. One of the major research directions in computational group theory …

A NEW COMPUTER CONSTRUCTION OF THE MONSTER USING 2-LOCAL SUBGROUPS
Page 1 J. London Math. Soc. (2) 67 (2003) 349–364 Cf2003 London Mathematical Society DOI …

Algorithms for matrix groups Page 12 ALGORITHMS FOR MATRIX GROUPS EA O'BRIEN
Department of Mathematics, University of Auckland, Auckland, New Zealand Email: obrien …