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
Asymptotic Results for Primitive Permutation Groups and Irreducible Linear Groups
โ Scribed by A. Lucchini; F. Menegazzo; M. Morigi
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 135 KB
- Volume
- 223
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
โฆ Synopsis
A well-developed branch of asymptotic group theory studies the properties of classes of linear and permutation groups as functions of their degree. We refer to the surveys of Cameron [4] and Pyber [17,18] and the recent paper by Pyber and Shalev [19] for a detailed exposition of this subject. In this paper we concentrate our attention on the number of generators. Our results, like most recent results in this area, depend on the classification of finite simple groups (which will be referred to hereafter as CFSG).
Concerning linear groups, in 1991, Kovรกcs and Robinson [11] proved that every finite completely reducible linear group of dimension d can be generated by 3 2 d elements, and afterwards, in 1993, Bryant, et al. [3] proved the following result: to each field F whose degree over its prime subfield is finite,
๐ SIMILAR VOLUMES
A base of a permutation group G is a sequence B of points from the permutation domain such that only the identity of G fixes B pointwise. We show that primitive permutation groups with no alternating composition factors of degree greater than d and no classical composition factors of rank greater th