Abstract
We describe an algorithm to compute the automorphism group of a finite p-group. A description of the automorphism group is built up by working down successive terms of the lower exponent-p central series of the group. The algorithm is a significant improvement over existing techniques. An implementation of the algorithm is publicly available.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wieb Bosma and John Cannon, Handbook of Magma functions. Department of Pure Mathematics, Sydney University, 1993.
John J. Cannon, An Introduction to the Group Theory Language, Cayley, in: M. D. Atkinson (ed.), Computational Group Theory, (Durham, 1982), London: Academic Press, 1984, pp. 145–183.
V. Felsch & J. Neuböser, Über ein Programm zur Berechnung der Automorphismengruppe einer endlichen Gruppe, Numer. Math. 11 1968, 277–292.
V. Felsch & J. Neuböser, On a programme for the determination the automorphism group of a finite group, in: Computational Problems in Abstract Algebra (Oxford 1967), pp. 59–60. Oxford: Pergamon Press, 1970.
L. Gerhards & E. Altmann, A computational method for determining the automorphism group of a finite solvable group, in: Computational Problems in Abstract Algebra (Oxford 1967), pp. 61–74. Oxford: Pergamon Press, 1970.
M. F. Newman, Determination of groups of prime-power order, in: Group Theory (Canberra, 1975 ), Lecture Notes in Math. 573, Berlin: Springer-Verlag, pp. 73–84.
E. A. O’Brien, The p-group generation algorithm, J. Symbolic Comput. 9 (1990), 677698.
E. A. O’Brien, Isomorphism testing for p-groups,J. Symbolic Comput. 17 (1994), 133147.
Heinrich Robertz, Eine Methode zur Berechnung der Automorphismengruppe einer endlichen Gruppe. Diplomarbeit, RWTH Aachen, 1976.
Martin Schönert et al.,GAP — Groups, Algorithms and Programming. Lehrstuhl D. für Mathematik, RWTH, Aachen, 1993.
Martin Wursthorn, Isomorphisms of modular group algebras: An algorithm and its application to groups of order 2 6,J. Symbolic Comput. 15 (1993), 211–227.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
O’Brien, E.A. (1995). Computing Automorphism Groups of p-Groups. In: Bosma, W., van der Poorten, A. (eds) Computational Algebra and Number Theory. Mathematics and Its Applications, vol 325. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1108-1_6
Download citation
DOI: https://doi.org/10.1007/978-94-017-1108-1_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4560-7
Online ISBN: 978-94-017-1108-1
eBook Packages: Springer Book Archive