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
Representing the Quotient Groups of a Finite Permutation Group
β Scribed by Derek F. Holt; Jacqueline Walton
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 207 KB
- Volume
- 248
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
β¦ Synopsis
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 faithful permutation representation of degree at most c d-1 .  2002 Elsevier Science (USA)
π SIMILAR VOLUMES
A group G satisfies the permutizer condition P if each proper subgroup H of G permutes with some cyclic subgroup not contained in H. The structure of finite groups with P is studied, the main result being that such groups are soluble with chief factors of order 4 or a prime. The classification of fi
## dedicated to john cossey on the occasion of his 60th birthday An extension of the well-known Frobenius criterion of p-nilpotence in groups with modular Sylow p-subgroups is proved in the paper. This result is useful to get information about the classes of groups in which every subnormal subgrou
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.