Article contents
ENUMERATING TRANSITIVE FINITE PERMUTATION GROUPS
Published online by Cambridge University Press: 01 November 1998
Abstract
Denote by f(n) the number of subgroups of the symmetric group Sym(n) of degree n, and by ftrans(n) the number of its transitive subgroups. It was conjectured by Pyber [9] that almost all subgroups of Sym(n) are not transitive, that is, ftrans(n)/f(n) tends to 0 when n tends to infinity. It is still an open question whether or not this conjecture is true. The difficulty comes from the fact that, from many points of view, transitivity is not a really strong restriction on permutation groups, and there are too many transitive groups [9, Sections 3 and 4]. In this paper we solve the problem in the particular case of permutation groups of prime power degree, proving the following result.
- Type
- Notes and Papers
- Information
- Copyright
- © The London Mathematical Society 1998
- 4
- Cited by