Fast recognition of doubly transitive groups

P. J. Cameron*, J. Cannon

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

The availability of the classification of finite simple groups allows us to design algorithms for identifying the composition factors of finite groups. This paper presents an algorithm which identifies any finite doubly transitive permutation group G. If we exclude the 2-transitive subgroups of the one-dimensional affine group and 14 small exceptional groups, the cost of our algorithm is essentially the cost of constructing a base and strong generating set for G. Consequently, our algorithm avoids the need to compute the soluble residual of G as required by Kantor's composition factors algorithm for a general permutation group.

Original languageEnglish
Pages (from-to)459-474
Number of pages16
JournalJournal of Symbolic Computation
Volume12
Issue number4-5
DOIs
Publication statusPublished - 1 Jan 1991

Fingerprint

Dive into the research topics of 'Fast recognition of doubly transitive groups'. Together they form a unique fingerprint.

Cite this