The ANU pq provides access to implementations of the following algorithms:
1. A p-quotient algorithm to compute a power-commutator presentation for a group of prime power order. The algorithm implemented here is based on that described in Newman and O'Brien (1996), Havas and Newman (1980), and papers referred to there. Another description of the algorithm appears in Vaughan-Lee (1990). A FORTRAN implementation of this algorithm was programmed by Alford and Havas. The basic data structures of that implementation are retained.
2. A p-group generation algorithm to generate descriptions of groups of prime power order. The algorithm implemented here is based on the algorithms described in Newman (1977) and O'Brien (1990). A FORTRAN implementation of this algorithm was earlier developed by Newman and O'Brien.
3. A standard presentation algorithm used to compute a canonical power-commutator presentation of a p-group. The algorithm implemented here is described in O'Brien (1994).
4. An algorithm which can be used to compute the automorphism group of a p-group. The algorithm implemented here is described in O'Brien (1994).
The following section describes the installation of the ANU pq package, a description of the functions available in the ANU pq package is given in chapter ANU Pq.
A reader interested in details of the algorithms and explanations of terms used is referred to NO96, HN80, OBr90, OBr94, OBr95, New77, Vau84, Vau90a, and Vau90b.
For details about the implementation and the standalone version see the README. This implementation was developed in C by
Lehrstuhl D fuer Mathematik
Previous Up Top Next