A permutation group is said to be quasiprimitive if all its non-trivial normal subgroups are transitive. We investigate pairs (G, H ) of permutation groups of degree n such that G H S n with G quasiprimitive and H primitive. An explicit classification of such pairs is obtained except in the cases wh
Quotients and inclusions of finite quasiprimitive permutation groups
β Scribed by Cheryl E. Praeger
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 283 KB
- Volume
- 269
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
β¦ Synopsis
A permutation group is said to be quasiprimitive if each non-trivial normal subgroup is transitive. Finite quasiprimitive permutation groups may be classified into eight types, in a similar fashion to the case division of finite primitive permutation groups provided by the O'Nan-Scott Theorem. The action induced by an imprimitive quasiprimitive permutation group on a non-trivial block system is faithful and quasiprimitive, but may have a different quasiprimitive type from that of the original permutation action. All possibilities for such differences are determined. Suppose that G < H < Sym(β¦) with G, H quasiprimitive and imprimitive. Then for each non-trivial H -invariant partition B of β¦, we have an inclusion G B < H B Sym(B) with H B βΌ = H and G B βΌ = G, and H B is primitive if B is maximal. The inclusions (G B , H B ) in the case where H B is primitive have been described in work of Baddeley and the author, but it turns out that many of them have no proper liftings to imprimitive quasiprimitive inclusions (G, H ). We show that either G and H have the same socle and the same quasiprimitive type, or the inclusion (G, H ) is associated in a well defined way with a proper factorisation S = AT where S and T are both non-abelian simple groups.
π SIMILAR VOLUMES
Let G be a permutation group of finite degree d. We prove that the product of the orders of the composition factors of G that are not alternating groups acting naturally, in a sense that will be made precise, is bounded by c d-1 /d, where c = 4 5. We use this to prove that any quotient G/N of G has
A permutation group G is said to be a group of finite type {k}, k a positive integer, if each nonidentity element of G has exactly k fixed points. We show that a group G can be faithfully represented as an irredundant permutation group of finite type if and only if G has a non-trivial normal partiti
Let F be a finite field. We apply a result of Thierry Berger (1996, Designs Codes Cryptography, 7, 215-221) to determine the structure of all groups of permutations on F generated by the permutations induced by the linear polynomials and any power map which induces a permutation on F.