Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-05T00:18:49.991Z Has data issue: false hasContentIssue false

A computer application to finite p-groups

Published online by Cambridge University Press:  09 April 2009

I. D. Macdonald
Affiliation:
Department of mathematics University of Striling, Scotland.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The first and still the best known computer application to groups exploits coset enumeration and this has been very thoroughly studied; see for instance [2] and [8]. No doubt this is because the algorithm is simple in the sense of programming. The Underlying mathematics is far from simple, touching as it does no logical difficulties akin to the word problem for groups, and this is reflected in the facts that random access to large tables is required and that there is no indication at any stage (for example when storage space is exhausted) whether the algorithm would be completed at any later stage. Efficient computation depends on choosing a subgroup of small index m in the group under examination, for group elements will be represented as permutations of degree m, and the larger m is the more tedious it will be to check properties like orders of group elements. Yet in many cases m may have to be fairly large so that the subgroup is “corefree” i.e. the representation is faithful.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1974

References

[1]Hall, M., The Theory of Groups (Macmillan, New york, 1959).Google Scholar
[2]Leech, J., ‘Coast enumeration on digital computers’, Proc. Cambridge Philos. Soc. 59 (1963), 257267.CrossRefGoogle Scholar
[3]Macdonald, I. D., ‘On a class of finitely presented groups’, Canad. J. Math. 14 (1962), 602613.CrossRefGoogle Scholar
[4]Macdonald, I. D., ‘Some examples in the theory of groups’, Mathematical Essays dedecated to A. J. Macintyre, (Ohio University press, Athens, Ohio, 1970), 263269.Google Scholar
[5]Macdonald, I. D., ‘An application of mcoset enumeration’, to appear in Austral. Comput. J.Google Scholar
[6]Macdonald, I. D. and Newman, B. H., ‘A third-Engel 5-group’, J. Austral. Math. Soc. 7 (1967), 555569.CrossRefGoogle Scholar
[7]Neumann, Hanna, Varieties of groups (springer, Berlin, 1967).CrossRefGoogle Scholar
[8]Trotter, H. F., ‘A machine program for coast enumeration’, Canad. Math. Bull. 7 (1964), 357368.CrossRefGoogle Scholar
[9]Wright, C. R. B., ‘On the nilpotency class of a group of exponent four’, Pacific J. Math. 11 (1961), 387394.CrossRefGoogle Scholar