Abstract
The three lectures “Computing in Soluble Groups” given by the second author as part of the “Seminar on Computational Algebra” at the Department of Mathematics of the University of Rome “Tor Vergata” on March 22./23., 1990 embedded a report on some recent work on the topic mentioned in the title of this paper into a survey of the state of the art in that wider field. In this paper a reminiscence of that overview will be confined to some very sketchy historical remarks in this introduction, but the bibliography should still be sufficient to obtain a reasonable coverage of the literature on the field by tracing back.
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.
Similar content being viewed by others
Bibliography
Cannon, J., A Computational Toolkit for Finite Permutation Groups. M. Aschbacher et al., ed., Proc. Rutgers Group Theory Year 1983/84, Cambridge U.P. 1984, 1–18.
Cordon, S.B., Calculating characters of p-groups. J. Symbolic Comp, to appear.
Felsch, V., Neubüser, J., An algorithm for the computation of con-jugacy classes and centralizers in p-groups. Lecture Notes in Computer Science 72 (1979) 452–465.
Glasby, S.P., Slattery, M.C., Computing intersections and normalizers in soluble groups. J. Symbolic Comp, to appear.
Havas, G., Nicholson, T., Collection. R.D. Jenks, ed., SYMSAC’76, Assoc. Comp. Mach., New York (1976) 9–14.
Holt, D.F., The calculation of the Schur multiplier of a permutation group. M.D. Atkinson, ed., Computational Group Theory, Acad. Press (1984) 307–319.
Leedham-Green, CR., Soicher, L.H., Collection from the Left and other Strategies. J. Symbolic Comp, to appear.
Laue, R., Neubüser, J., Schoenwaelder, U., Algorithms for finite soluble groups and the SO G OS system. M.D. Atkinson, ed., Computational Group Theory, Acad. Press (1984) 105–135.
Macdonald, I. D., A computer application to finite p-groups. J. Austral. Math. Soc. 17 (1974) 102–112.
Mecky, M., Neubüser, J., Some remarks on the computation of con-jugacy classes of soluble groups. Bull. Austral. Math. Soc. 40 (1989) 281–292.
Neubüser, J., Bestimmung der Untergruppenverbände endlicherp-Gruppen auf einer programmgesteuerten elektronischen Dualmaschine. Nu-mer. Math. 3 (1961) 271–278.
Newman, M.F., Calculating presentations for certain kinds of quotient groups. R.D. Jenks, ed., SYMSAC’76, Assoc. Comput. Mach., New York (1976) 2–8.
Niemeyer, A., Nickel, W., Schönert, M., GAP. Getting started and Reference Manual. Lehrstuhl D für Mathematik, RWTH Aachen, 1988.
O’Brien, E.A., The p-group generation algorithm. J. Symbolic Comp, to appear.
Plesken, W., Towards a soluble quotient algorithm. J. Symbolic Comp. 4 (1987) 111–122.
Sims, C.C., Verifying Nilpotence. J. Symbolic Comp. 3 (1987) 231–247.
Sims, C.C., Implementing the Baumslag-Cannonito-Miller Poly cyclic Quotient Algorithm. J. Symbolic Comp, to appear.
Sims, C.C., Computing the Order of a Solvable Permutation Group. J. Symbolic Comp, to appear.
Vaughan-Lee, M.R., Collection from the Left. J. Symbolic Comp, to appear.
Wright, C.R.B., A Pseudo-Cayley complementation procedure for soluble groups. Manuscript 1988, University of Oregon.
Wright, C.R.B., Recursive Algorithms for computing complements in Finite Groups. Manuscript 1988, University of Oregon.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Additional information
Dedicated to Wolfgang Gaschütz, to whom we owe so much of our understanding of soluble groups, on the occasion of his seventieth birthday
Rights and permissions
Copyright information
© 1990 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Celler, F., Neubüser, J., Wright, C.R.B. (1990). Some remarks on the computation of complements and normalizers in soluble groups. In: Cattaneo, G.M.P., Strickland, E. (eds) Topics in Computational Algebra. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-3424-8_3
Download citation
DOI: https://doi.org/10.1007/978-94-011-3424-8_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-5514-7
Online ISBN: 978-94-011-3424-8
eBook Packages: Springer Book Archive