Bibliography

Asc84

M. Aschbacher.
On the maximal subgroups of the finite classical groups.
Invent. Math, 76:469--514, 1984.

But76

Gregory Butler.
The Schreier Algorithm for Matrix Groups.
In Proceedings of SYMSAC '76, pages 167--170, 1976.

CLG91

C.E. Praeger & L.H. Soicher C.R. Leedham-Green.
Computing with group homomorphisms.
J. Symbolic Comp., 12(4/5):527--532, 1991.

CLG97a

Frank Celler and Charles R. Leedham-Green.
Calculating the Order of an Invertible Matrix.
In Larry Finkelstein and William M. Kantor, editors, Groups and Computation II, volume 28 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 55--60. AMS, 1997.

CLG97b

Frank Celler and C.R. Leedham-Green.
A non-constructive recognition algorithm for the special linear and other classical groups.
In Groups and computation II (New Brunswick, NJ, 1995), volume 28 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 61--67. Amer. Math. Soc., 1997.

CLGM+95

Frank Celler, Charles R. Leedham-Green, Scott H. Murray, Alice C. Niemeyer, and E. A. O'Brien.
Generating random elements of a finite group.
Comm. Algebra, 23(13):4931--4948, 1995.

DFH96a

E.A. O'Brien & Sarah Rees Derek F. Holt, C.R. Leedham-Green.
Computing decompositions for modules with respect to a normal subgroup.
J. Algebra, 184:818--838, 1996.

DFH96b

E.A. O'Brien & Sarah Rees Derek F. Holt, C.R. Leedham-Green.
Testing matrix groups for primitivity.
J. Algebra, 184:795--817, 1996.

ELGO02

Bettina Eick, C.R. Leedham-Green, and E.A. O'Brien.
Constructing automorphism groups of a p-groups.
Comm. Algebra, 30:2271--2295, 2002.

GH97

S.P. Glasby and R.B. Howlett.
Writing representations over minimal fields.
Comm. Algebra, 25(6):1703--1711, 1997.

LGO02

C.R. Leedham-Green and E.A. O'Brien.
Recognising tensor-induced matrix groups.
J. Algebra, 253:14--30, 2002.

MO95

Scott H. Murray and E. A. O'Brien.
Selecting base points for the Schreier-Sims algorithm for matrix groups.
J. Symbolic Comp., 6:577--584, 1995.

NP92

Peter M. Neumann and Cheryl E. Praeger.
A Recognition Algorithm for Classical Groups.
Proc. London Math. Soc., 65(3):555--603, 1992.

NP97

Alice C. Niemeyer and Cheryl E. Praeger.
Implementing a Recognition Algorithm for Classical Groups.
In Groups and computation II (New Brunswick, NJ, 1995), volume 28 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 273--296. Amer. Math. Soc., 1997.

NP98

Alice C. Niemeyer and Cheryl E. Praeger.
A Recognition Algorithm for Classical Groups over Finite Fields.
Proc. London Math. Soc., 77(3):117--169, 1998.

NP99

Alice C. Niemeyer and Cheryl E. Praeger.
A Recognition Algorithm for Non-Generic Classical Groups over Finite Fields.
J. Austral. Math. Soc. Ser. A, 67:223--253, 1999.

O'B90

E.A. O'Brien.
The p-group generation algorithm.
J. Symbolic Comput., 9:677--698, 1990.

O'B97a

C.R. Leedham-Green & E.A. O'Brien.
Tensor Products are Projective Geometries.
J. Algebra, 189:514--528, 1997.

O'B97b

C.R. Leedham-Green & E.A. O'Brien.
Tensor Products are Projective Geometries.
Internat. J. Algebra Comput., 7:541--559, 1997.

Pra99

Cheryl E. Praeger.
Primitive prime divisor elements in finite classical groups.
In Proc. of Groups St. Andrews 1997 in Bath II, number 261 in London Math. Soc. Lecture Notes Series, pages 605--623. Cambridge Univ. Press, 1999.

RT98

L.J. Rylands and D.E. Taylor.
Matrix generators for the orthogonal groups.
J. Symbolic Comp., 25:351--360, 1998.

Sch00

Ruth Schwingel.
Two matrix group algorithms with applications to computing the automorphism group of a finite p-group.
PhD thesis, Queen Mary and Westfield College, University of London, 2000.

Tay87

Don Taylor.
Pairs of Generators for Matrix Groups. I.
Cayley Bulletin 3, 1987.

Ung

W.R. Unger.
Computing chief series of a large permutation group.
In preparation.

Ung02

W.R. Unger.
Computing the solvable radical of a permutation group.
In preparation, 2002.