Hostname: page-component-745bb68f8f-grxwn Total loading time: 0 Render date: 2025-01-27T11:09:46.118Z Has data issue: false hasContentIssue false
  • English
  • Français

Computational approaches to the theory of finite soluble groups

Published online by Cambridge University Press:  17 April 2009

Stephen Peter Glasby
Stephen Peter Glasby
Affiliation:
Department of Pure Mathematics, The University of Sydney, New South Wales, 2006, Australia
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Abstracts of Australasian of PhD theses
Information
Bulletin of the Australian Mathematical Society , Volume 38 , Issue 1 , August 1988 , pp. 157 - 158
Copyright
Copyright © Australian Mathematical Society 1988

References

[1]Coppersmith, D., ‘Evaluating logarithms in GF(2n)’, in Proc. 16th Annual ACM Symp. on the Theory of Computing: Association for Computing Machinery, pp. 201–207, 1984.Google Scholar
[2]Glasby, S.P., ‘Constructing normalisers in finite soluble groups’, J. Symbolic Computation (1988) (to appear).Google Scholar
[3]Glasby, S.P., ‘Intersecting subgroups of a finite soluble group’, J. Symbolic Computation (1988) (to appear).Google Scholar
[4]Glasby, S.P., ‘Constructing finite soluble groups’, Cayley Bulletin, University of Sydney 3 (1987), 106–112.Google Scholar
[5]Havas, C. and Newman, M.F., ‘Applications of computers to questions like those of Burn-side’: Burnside Groups, Proc. Conf. Bielefeld, Germany. Lecture Notes in Mathematic 806, 211–230. (Springer-Verlag,Berlin).CrossRefGoogle Scholar