GAP package AutPGrp: Computing the Automorphism Group of a p-Group. The AutPGrp package introduces a new function to compute the automorphism group of a finite $p$-group. The underlying algorithm is a refinement of the methods described in O’Brien (1995). In particular, this implementation is more efficient in both time and space requirements and hence has a wider range of applications than the ANUPQ method. Our package is written in GAP code and it makes use of a number of methods from the GAP library such as the MeatAxe for matrix groups and permutation group functions. We have compared our method to the others available in GAP. Our package usually out-performs all but the method designed for finite abelian groups. We note that our method uses the small groups library in certain cases and hence our algorithm is more effective if the small groups library is installed.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Eick, Bettina; Wesche, Morten: Enumeration of nilpotent associative algebras of class 2 over arbitrary finite fields (2018)
- Eick, Bettina; Horn, Max; Hulpke, Alexander: Constructing groups of `small’ order: recent results and open problems (2017)
- Eick, Bettina; Horn, Max: The construction of finite solvable groups revisited. (2014)
- Eick, Bettina: Computing (p)-groups with trivial Schur multiplicator. (2009)