Enumerating p-groups

Journal of the Australian Mathematical Society

Volumn 67, Issue 2, 1999, Pages 191-205

  Eick, Bettina ^a   O'Brien, E A ^b  

^a UNIVERSITY OF KASSEL   (Germany)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Cauchy Frobenius lemma; Cohomology; Enumeration; p groups

Indexed keywords

EID: 0039110577     PISSN: 14467887     EISSN: None     Source Type: Journal    
DOI: 10.1017/s1446788700001166     Document Type: Article

References (19)

1. H. U. Besche and B. Eick, 'Construction of finite groups', J. Symbolic Comput. 27 (1999), 387-404.
2. _, 'The groups of order at most 1000 except 512 and 768', J. Symbolic Comput. 27 (1999), 405-413.
3. n · p', Technical Report.
4. G. Birkhoff, 'Subgroups of Abelian groups', Proc. London Math. Soc. 38 (1934), 385-401.
5. W. Bosma, J. Cannon and C. Playoust, 'The MAGMA algebra system I: The user language', J. Symbolic Comput. 24 (1997), 235-265.
6. G. Higman, 'Enumerating p-groups. I: Inequalities', Proc. London Math. Soc. 10 (1960), 24-30.
7. R. James, M. F. Newman and E. A. O'Brien, 'The groups of order 128', J. Algebra 129 (1990), 136-158.
8. J. Neubüser, 'Investigations of groups on computers', in: Computational problems in abstract algebra (Pergamon Press, Oxford, 1967) pp. 1-19.
9. M. F. Newman, 'Determination of groups of prime-power order', in: Croup theory (Canberra 1975), Lecture Notes in Math. 573 (Springer, Berlin, 1977) pp. 73-84.
10. E. A. O'Brien, The p-group generation algorithm', J. Symbolic Comput. 9 (1990), 677-698.
11. _, 'The groups of order 256', J. Algebra 143 (1991), 219-235.
12. _, 'Computing automorphism groups of p-groups', in: Computational algebra and number theory (Sydney, 1992) (Kluwer Academic Publ., Dordrecht, 1995) pp. 83-90.
13. _, 'Bibliography on the determination of finite groups', Available from http://www.math.auckland.ac.nz/~obrien.
14. D. J. Robinson, A course in the theory of groups, Graduate Texts in Math. 80, 2nd Edition (Springer, New York, 1996).
15. C. C. Sims, 'Enumerating p-groups', Proc. London Math. Soc. 15 (1965), 151-166.
16. _, Computation with finitely presented groups (Cambridge University Press, New York, 1994).
17. The GAP Team, GAP - Groups, algorithms, and programming, version 4, Lehrstuhl D für Mathematik, RWTH Aachen, and School of Mathematical and Computational Sciences, University of St Andrews, 1999.
18. M. R. Vaughan-Lee, 'An aspect of the nilpotent quotient algorithm', in: Computational group theory (Durham, 1982) (Academic Press, London, 1984) pp. 76-83.
19. A. Wegner, The construction of finite soluble factor groups of finitely presented groups and its applications (Ph.D. Thesis, University of St Andrews, 1992).