This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
Computational problems in abstract algebra (Proceedings of a conference, Oxford, 1967), edited by John Leech. Pergamon, Oxford, 1970.
Computers in algebra and number theory (Proceedings of a symposium in applied mathematics, New York, 1970), edited by Garrett Birkhoff and Marshall Hall, Jr.. SIAM-AMS Proceedings, Vol. 4, Amer. Math. Soc., Providence, R.I., 1971.
Proceedings of the second international conference on the theory of groups (Austral. Nat. Univ., Canberra, 1973), edited by M. F. Newman. Lecture Notes in Mathematics, Vol.372, Springer, Berlin, 1974.
SYMSAC '76, Proceedings of the 1976 ACM symposium on symbolic and algebraic computation (Yorktown Heights, N.Y., 1976), edited by R.D. Jenks. Assoc. Comput. Mach., New York, 1976.
Bayes, A.J.; Kautsky, J.; Wamsley, J.W.: Computation in nilpotent groups (application). pp. 82–89 in [3].
Cannon, John J.: Computing local structure of large finite groups. pp. 161–176 in [2].
Cannon, John: A general purpose group theory program. pp. 204–217 in [3].
Dixon, John D.: High speed computation of group characters. Numer. Math. 10 (1967), 446–450.
Felsch, Volkmar: A machine independent implementation of a collection algorithm for the multiplication of group elements. pp. 159–166 in [4].
Felsch, V.; Felsch, W.; Neubüser, J.; Plesken, W.: On p-groups and space groups. IV. Some counterexamples to the class-breadth conjecture. To be published.
Havas, George; Nicholson, Tim: Collection. pp. 9–14 in [4].
Jürgensen, H.: Calculation with the elements of a finite group given by generators and defining relations. pp. 47–57 in [1].
Leedham-Green, C.R.; Neumann, Peter M.; Wiegold, James: The breadth and the class of a finite p-group. J. London Math. Soc. 1 (1969), 409–420.
Macdonald, I.D.: A computer application to finite p-groups. J. Austral. Math. Soc. 17 (1974), 102–112.
Neubüser, J.: Bestimmung der Untergruppenverbände endlicher p-Gruppen auf einer programmgesteuerten elektronischen Dualmaschine. Numer. Math. 3 (1961), 271–278.
Newman, M.F.: Calculating presentations for certain kinds of quotient groups. pp. 2–8 in [4].
Robertz, Heinrich: Eine Methode zur Berechnung der Automorphismengruppe einer endlichen Gruppe. Diplomarbeit, RWTH Aachen, 1976.
Sims, Charles C.: Determining the conjugacy classes of a permutation group. pp. 191–195 in [2].
Wamsley, J.W.: Computation in nilpotent groups (theory). pp. 691–700 in [3].
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Felsch, V., Neubüser, J. (1979). An algorithm for the computation of conjugacy classes and centralizers in p-groups. In: Ng, E.W. (eds) Symbolic and Algebraic Computation. EUROSAM 1979. Lecture Notes in Computer Science, vol 72. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09519-5_95
Download citation
DOI: https://doi.org/10.1007/3-540-09519-5_95
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09519-4
Online ISBN: 978-3-540-35128-3
eBook Packages: Springer Book Archive