𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Transitive Subgroups of Primitive Permutation Groups

✍ Scribed by Martin W. Liebeck; Cheryl E. Praeger; Jan Saxl


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
492 KB
Volume
234
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

✦ Synopsis


to helmut wielandt on the occasion of his 90th birthday

We investigate the finite primitive permutation groups G which have a transitive subgroup containing no nontrivial subnormal subgroup of G. The conclusion is that such primitive groups are rather rare, and that their existence is intimately connected with factorisations of almost simple groups. A corollary is obtained on primitive groups which contain a regular subgroup. Heavily involved in our proofs are some new results on subgroups of simple groups which have orders divisible by various primes. For example, another corollary implies that for every simple group T apart from L 3 3 , U 3 3 , and L 2 p with p a Mersenne prime, there is a collection consisting of two or three odd prime divisors of T , such that if M is a subgroup of T of order divisible by every prime in , then M is divisible by all the prime divisors of T , and we obtain a classification of such subgroups M.


πŸ“œ SIMILAR VOLUMES


Transitive Permutation Groups of Minimal
✍ Avinoam Mann; Cheryl E. Praeger πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 133 KB

For a permutation group G on a set S, the mo¨ement of G is defined as the maximum cardinality of subsets T of S for which there exists an element x g G x Ž such that T is disjoint from its translate T that is, when such subsets have . bounded cardinality . It was shown by the second author that, if

Asymptotic Results for Primitive Permuta
✍ L Pyber; A Shalev πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 216 KB

We prove that the number of conjugacy classes of primitive permutation groups cΕ½ n. ## Ε½ . of degree n is at most n , where n denotes the maximal exponent occurring in the prime factorization of n. This result is applied to investigating maximal subgroup growth of infinite groups. We then proceed

Computing Sylow Subgroups in Permutation
✍ JOHN CANNON; BRUCE COX; DEREK HOLT πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 371 KB

We describe the theory and implementation of a practical algorithm for computing a Sylow subgroup of a permutation group and for finding an element that conjugates one Sylow subgroup to another. The performance of the current implementations in the Magma system represents a significant improvement o

Computing the Subgroups of a Permutation
✍ John J. Cannon; Bruce C. Cox; Derek F. Holt πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 279 KB

A new method for computing the conjugacy classes of subgroups of a finite group is described.