---
title: "Bibliography"
canonical: "https://docs.magma-maths.org/FiniteGroups/FiniteSolubleGroups/bibliography.html"
source: "https://docs.magma-maths.org/FiniteGroups/FiniteSolubleGroups/bibliography.md"
part: "Finite Groups"
chapter: "Finite Soluble Groups"
breadcrumbs:
  - {"title": "Magma Handbook", "source": "../../index.md"}
  - {"title": "Finite Groups", "source": "../index-finite-groups.md"}
  - {"title": "Finite Soluble Groups", "source": "index-finite-soluble-groups.md"}
prev: {"title": "$p$-Groups of Tame Genus", "source": "tame.md"}
next: {"title": "Black-Box Groups", "source": "../BlackBoxGroups/index-black-box-groups.md"}
---

# Bibliography

<a id="cite-bmw-genus2"></a>
- **[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. URL: [https://doi.org/10.1016/j.jalgebra.2016.12.007](https://doi.org/10.1016/j.jalgebra.2016.12.007), [doi:10.1016/j.jalgebra.2016.12.007](https://doi.org/10.1016/j.jalgebra.2016.12.007).
<a id="cite-bw-isometry"></a>
- **[BW12b]** Peter A. Brooksbank and James B. Wilson. Computing isometry groups of Hermitian maps. *Trans. Amer. Math. Soc.*, 364(4):1975–1996, 2012. URL: [https://doi.org/10.1090/S0002-9947-2011-05388-2](https://doi.org/10.1090/S0002-9947-2011-05388-2), [doi:10.1090/S0002-9947-2011-05388-2](https://doi.org/10.1090/S0002-9947-2011-05388-2).
<a id="cite-cnw-compls"></a>
- **[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.
<a id="cite-conlon-chtrs"></a>
- **[Con90a]** S. B. Conlon. Calculating characters of $p$-groups. *J. Symbolic Comp.*, 9:535–550, 1990.
<a id="cite-conlon-degrees"></a>
- **[Con90b]** S. B. Conlon. Computing modular and projective character degrees of soluble groups. *J. Symbolic Comp.*, 9:551–570, 1990.
<a id="cite-ch-classes"></a>
- **[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.
<a id="cite-elo-auts"></a>
- **[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.
<a id="cite-eo-enum"></a>
- **[EO99]** Bettina Eick and E.A. O'Brien. Enumerating $p$-groups. *J. Austral. Math. Soc.*, 67:191–205, 1999.
<a id="cite-fo-centex"></a>
- **[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.
<a id="cite-gs-intnorm"></a>
- **[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.
<a id="cite-howden-thesis"></a>
- **[How12]** David J. A. Howden. *Computing automorphism groups and isomorphism testing in finite groups*. PhD thesis, University of Warwick, 2012.
<a id="cite-hulpke-subs"></a>
- **[Hul99]** Alexander Hulpke. Computing subgroups invariant under a set of automorphisms. *J. Symbolic Comp.*, 27:415–427, 1999.
<a id="cite-lgm-book"></a>
- **[LGM02a]** 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. ISBN 0-19-853548-1. Oxford Science Publications.
<a id="cite-lm-semi-extraspecial"></a>
- **[LM18]** Mark L. Lewis and Joshua Maglione. Enumerating isoclinism classes of semi-extraspecial groups. 2018. [arXiv:1806.10511](https://arxiv.org/abs/1806.10511).
<a id="cite-mecky-neubuser"></a>
- **[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.
<a id="cite-newman-pgrp-gen"></a>
- **[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.
<a id="cite-obrien-pgroup"></a>
- **[OBr90]** E.A. O'Brien. The $p$-group generation algorithm. *J. Symbolic Comput.*, 9:677–698, 1990.
<a id="cite-obrien-isom"></a>
- **[OBr94]** E.A. O'Brien. Isomorphism testing for $p$-groups. *J. Symbolic Comp.*, 17:133–147, 1994.
<a id="cite-slat-degs"></a>
- **[Sla86]** Michael C. Slattery. Computing character degrees in $p$-groups. *J. Symbolic Comp.*, 2:51–58, 1986.
<a id="cite-slat-cosets"></a>
- **[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).
<a id="cite-smith-thesis"></a>
- **[Smi94]** Michael J. Smith. *Computing automorphisms of finite soluble groups*. PhD thesis, Australian National University, 1994.
<a id="cite-chtr-table-unger"></a>
- **[Ung06a]** W.R. Unger. Computing the character table of a finite group. *J. Symbolic Comp.*, 41(8):847–862, 2006.
<a id="cite-wilson-decomposable"></a>
- **[Wil12]** James B. Wilson. Existence, algorithms, and asymptotics of direct product decompositions, I. *Groups Complex. Cryptol.*, 4(1):33–72, 2012. URL: [https://doi.org/10.1515/gcc-2012-0007](https://doi.org/10.1515/gcc-2012-0007), [doi:10.1515/gcc-2012-0007](https://doi.org/10.1515/gcc-2012-0007).