Bibliography

Atk75
M.D. Atkinson.
An algorithm for finding the blocks of a permutation group.
Math. Comp., 29:911--913, 1975.

BC82
G. Butler and J.J. Cannon.
Computing with permutation and matrix groups I: Normal closure, commutator subgroups, series.
Math. Comp., 39:671--680, 1982.

Bea93
G. Beals.
Algorithms for finite groups.
PhD thesis, University of Chicago, 1993.

BLGN+03
R. Beals, C. R. Leedham-Green, A. C. Niemeyer, C. E. Praeger, and A. Seress.
A black-box algorithm for recognising finite symmetric and alternating groups, I.
Trans. Amer. Math. Soc., pages 2097--2113, 2003.

BP00
Sergey Bratus and Igor Pak.
Fast constructive recognition of a black box group isomorphic to Sn or An using Goldbach's conjecture.
J. Symbolic Comp., 29:33--57, 2000.

But85
Gregory Butler.
Effective computation with group homomorphisms.
J. Symbolic Comp., 1:143--157, 1985.

But94
Greg Butler.
An inductive schema for computing conjugacy classes in permutation groups.
Mathematics of Computation, 62(205):363--383, 1994.

CB92
J.J. Cannon and W. Bosma.
Structural computation in finite permutation groups.
CWI Quarterly, 5(2):127--160, 1992.

CC91
P.J. Cameron and J.J. Cannon.
Recognizing doubly transitive groups.
J. Symb. Comp., 12(4/5):459--474, 1991.

CCH97
J.J. Cannon, B. Cox, and D.F. Holt.
Computing Sylow subgroups in permutation groups.
J. Symb. Comp., 24(3/4):303--316, 1997.

CCH01
J.J. Cannon, B. Cox, and D.F. Holt.
Computing the subgroups of a permutation group.
J. Symb. Comp., 31:149--161, 2001.

CFL89
G. Cooperman, L. Finkelstein, and E.M. Luks.
Reduction of group constructions to point stabilizers.
In Proc. of International Symposium on Symbolic and Algebraic Computation ISSAC '89, pages 351--356. ACM, 1989.

CH97
J.J. Cannon and D.F. Holt.
Computing chief series, composition series and socles in large permutation groups.
J. Symb. Comp., 24(3/4):285--301, 1997.

CH03
J.J. Cannon and D.F. Holt.
Automorphism group computation and isomorphism testing in finite groups.
J. Symbolic Comp., 35(3):241--267, 2003.

CH04
J.J. Cannon and D.F. Holt.
Computing maximal subgroups of finite groups.
J. Symbolic Comp., 37(5):589--609, 2004.

CHSS03
J.J. Cannon, D.F. Holt, M. Slattery, and A.K. Steel.
Computing subgroups of low index in a finite group.
2003.

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.

CS
J.J. Cannon and B. Souvignier.
On the computation of normal subgroups in permutation groups.
to appear, International Journal of Algebra and Computation.

CS97
J.J. Cannon and B. Souvignier.
On the computation of conjugacy classes in permutation groups.
In Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, pages 392--399. Association for Computing Machinery, 1997.
Maui, July 21--23, 1997.

Geb00
Volker Gebhardt.
Constructing a short defining set of relations for a finite group.
J. Algebra, 233:526--542, 2000.

HL03
Alexander Hulpke and Steve Linton.
Total ordering on subgroups and cosets.
In Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, pages 156--160. ACM, New York, 2003.

Hol84
D.F. Holt.
The calculation of the Schur multiplier of a permutation group.
In Computational group theory (Durham, 1982), pages 307--319. Academic Press, London, 1984.

Hol85a
D.F. Holt.
A computer program for the calculation of a covering group of a finite group.
J. Pure Appl. Algebra, 35(3):287--295, 1985.

Hol85b
D.F. Holt.
The mechanical computation of first and second cohomology groups.
J. Symbolic Comp., 1(4):351--361, 1985.

JLNP13
S Jambor, M Leuner, A. C. Niemeyer, and W Plesken.
Fast recognition of alternating groups of unknown degree.
J. Algebra, 392:315--335, 2013.

Kan91
William M. Kantor.
Finding composition factors of permutation groups of degree n≤10sp 6.
J. Symbolic Comp., 12(4/5):517--526, 1991.

Leo80
Jeffrey S. Leon.
On an algorithm for finding a base and a strong generating set for a group given by generating permutations.
Math. Comp., 35(151):941--974, 1980.

Leo97
Jeffrey S. Leon.
Partitions, refinements, and permutation group com-pu-ta-tion.
In Larry Finkelstein and William M. Kantor, editors, Groups and Computation II, volume 28 of Dimacs series in Discrete Mathematics and Computer Science, pages 123--158, Providence R.I., 1997. Amer. Math. Soc.

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

LNPS06
M. Law, A.C. Niemeyer, C.E. Praeger, and A. Seress.
A reduction algorithm for for large-base primitive permutation groups.
LMS J. Comput. Math., 9:159â€&173, 2006.

Luk93
E.M. Luks.
Permutation groups and polynomial-time computation.
In Groups and computation (New Brunswick, NJ, 1991), volume 11 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 139--175. Amer. Math. Soc., 1993.

McK81
B. D. McKay.
Practical Graph Isomorphism.
Congressus Numerantium, 30:45--87, 1981.

MN89
M. Mecky and J. Neubüser.
Some remarks on the computation of conjugacy classes of soluble groups.
Bull. Austral, Math. Soc., 40(2):281--292, 1989.

Neu86
P.M. Neumann.
Some algorithms for computing with finite permutation groups.
In C.M. Campbell E.F. Robertson, editor, Groups - St. Andrews 1985, number 121 in London Math. Soc. Lecture Notes Series, 1986.

Ric73
J.S. Richardson.
Group: a computer system for group-theoretic calculations.
Master's thesis, Department of Pure Mathematics, University of Sydney, September 1973.

Sch90
Bernd Schmalz.
Verwendung von Untergruppenleitern zur Bestimmung von Doppelnebenklassen.
Bayreuther Mathematische Schriften, 31:109--143, 1990.

Ser03
Ákos Seress.
Permutation Group Algorithms, volume 152 of Cambridge Tracts in Mathematics.
Cambridge University Press, Cambridge, 2003.

Sim90
Charles C. Sims.
Computing the order of a solvable permutation group.
J. Symb. Comp., 9(5/6):699--705, 1990.

SS94
M. Schönert and A. Seress.
Finding blocks of imprimitivity in small-base groups in nearly linear time.
In Proc. 1994 ACM-SIGSAM Inter. Symp. on Symbolic and Algebraic Comp., pages 154--157, 1994.

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

Ung06a
W.R. Unger.
Computing the character table of a finite group.
J. Symbolic Comp., 41(8):847--862, 2006.

Ung06b
W.R. Unger.
Computing the solvable radical of a permutation group.
J. Algebra, 300(1):305--315, 2006.

V2.28, 13 July 2023