Abstract
The method described in [2] is essentially comprised of the following construction: Given the class n − 1 factor group of G, G/γ n (G), construct the factor group of class n. To implement this on a computer we need first a suitable description of the input, that is, G/γ n (G). This is dealt with in Section 2. Section 3 describes the algorithm of the computer program for extending the class. The extending is performed through a series of extensions by elementary abelian p-groups. Section 4 comments on the particular computer system used to perform the calculations, results of which are presented in Section 5.
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
I.D. Macdonald and J.W. Wamsley, “On the multiplicator of finite p-groups”, in preparation.
S.W. Wamsley, “Computation in nilpotent groups (theory)”, these Proc.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bayes, A.J., Kautsky, J., Wamsley, J.W. (1974). Computation in Nilpotent Groups (Application). In: Newman, M.F. (eds) Proceedings of the Second International Conference on the Theory of Groups. Lecture Notes in Mathematics, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21571-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-662-21571-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06845-7
Online ISBN: 978-3-662-21571-5
eBook Packages: Springer Book Archive