Bibliography

BMW17
Peter A. Brooksbank, Joshua Maglione, and James B. Wilson.
A fast isomorphism test for groups whose Lie algebra has genus 2.
J. Algebra, 473:545--590, 2017.

BW12
Peter A. Brooksbank and James B. Wilson.
Computing isometry groups of Hermitian maps.
Trans. Amer. Math. Soc., 364(4):1975--1996, 2012.

CH00
John Cossey and Trevor Hawkes.
On the largest conjugacy class size in a finite group.
Rend. Sem. Mat. Univ. Padova, 103:171--179, 2000.

CNW90
F. Celler, J. Neubüser, and C.R.B. Wright.
Some remarks on the computation of complements and normalizers in soluble groups.
Acta Appl. Math., 21:57--76, 1990.

Con90a
S. B. Conlon.
Calculating characters of p-groups.
J. Symbolic Comp., 9:535--550, 1990.

Con90b
S. B. Conlon.
Computing modular and projective character degrees of soluble groups.
J. Symbolic Comp., 9:551--570, 1990.

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.

EO99
Bettina Eick and E.A. O'Brien.
Enumerating p-groups.
J. Austral. Math. Soc., 67:191--205, 1999.

FO00
D.L. Flannery and E.A. O'Brien.
Computing 2-cocycles for central extensions and relative difference sets.
Comm. Algebra, 28:1935--1955, 2000.

GS90
S.P. Glasby and Michael C. Slattery.
Computing intersections and normalizers in soluble groups.
J. Symbolic Comp., 9:637--651, 1990.
Computational group theory, Part 1.

How12
David J. A. Howden.
Computing automorphism groups and isomorphism testing in finite groups.
PhD thesis, University of Warwick, 2012.

Hul99
Alexander Hulpke.
Computing subgroups invariant under a set of au-to-mor-ph-isms.
J. Symbolic Comp., 27:415--427, 1999.

LGM02
C. R. Leedham-Green and S. McKay.
The structure of groups of prime power order, volume 27 of London Mathematical Society Monographs. New Series.
Oxford University Press, Oxford, 2002.
Oxford Science Publications.

LM18
Mark L. Lewis and Joshua Maglione.
Enumerating isoclinism classes of semi-extraspecial groups, 2018.

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.

New77
M.F. Newman.
Determination of groups of prime-power order.
In Group Theory (Canberra, 1975), volume 573 of Lecture Notes in Mathematics, pages 73--84. Springer-Verlag, Berlin-Heidelberg-New York, 1977.

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

O'B94
E.A. O'Brien.
Isomorphism testing for p-groups.
J. Symbolic Comp., 17:133--147, 1994.

Sla86
Michael C. Slattery.
Computing character degrees in p-groups.
J. Symbolic Comp., 2:51--58, 1986.

Sla01
Michael C. Slattery.
Computing double cosets in soluble groups.
J. Symbolic Comp., 31:179--192, 2001.
Computational algebra and number theory (Milwaukee, WI, 1996).

Smi94
Michael J. Smith.
Computing automorphisms of finite soluble groups.
PhD thesis, Australian National University, 1994.

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

Wil12
James B. Wilson.
Existence, algorithms, and asymptotics of direct product decompositions, I.
Groups Complex. Cryptol., 4(1):33--72, 2012.

V2.28, 13 July 2023