The Affine Permutation Groups of Rank Three
نویسنده
چکیده
(iii) G is an ajfine group, that is, the socle of G is a vector space V, where V s= {ZpY for some prime p and n=p ; moreover, if Go is the stabilizer of the zero vector in V then G = VG0, Go is an irreducible subgroup of GLd(p), and GQ has exactly two orbits on the non-zero vectors of V. The rank 3 groups under (i) are given by the classification of the 2-transitive groups with simple socle (see § 5 of [5]). Those under (ii) are determined in [22] when the socle socG is a classical group, in [3] when socG is an alternating group, and in [27] when soc G is an exceptional group of Lie type or a sporadic group. The object of this paper is to determine completely the groups satisfying (iii), thus completing the classification of the finite primitive groups of rank 3. Our proof uses the classification of finite simple groups. The 2-transitive affine groups have been determined by Hering in [15]. Our methods can easily be used to give a proof of Hering's result, and we present this proof in Appendix 1, at the end of the paper. The finite soluble primitive groups of rank 3 are automatically affine groups, and these are determined by Foulser in [11]. We shall make use of his results and of some of his methods in one special case in our proof, which we call the 'extraspecial case'. Our main result is
منابع مشابه
AFFINE SUBGROUPS OF THE CLASSICAL GROUPS AND THEIR CHARACTER DEGREES
In this paper we describe how the degrees of the irreducible characters of the affine subgroups of the classical groups under consideration can be found inductively. In [4] Gow obtained certain character degrees for all of the affine subgroups of the classical groups. We apply the method of Fischer to the above groups and, in addition to the character degrees given in [4], we obtain some ne...
متن کاملON THE SPECTRUM OF DERANGEMENT GRAPHS OF ORDER A PRODUCT OF THREE PRIMES
A permutation with no fixed points is called a derangement.The subset $mathcal{D}$ of a permutation group is derangement if all elements of $mathcal{D}$ are derangement.Let $G$ be a permutation group, a derangementgraph is one with vertex set $G$ and derangement set $mathcal{D}$ as connecting set. In this paper, we determine the spectrum of derangement graphs of order a product of three primes.
متن کاملThe False Discovery Rate in Simultaneous Fisher and Adjusted Permutation Hypothesis Testing on Microarray Data
Background and Objectives: In recent years, new technologies have led to produce a large amount of data and in the field of biology, microarray technology has also dramatically developed. Meanwhile, the Fisher test is used to compare the control group with two or more experimental groups and also to detect the differentially expressed genes. In this study, the false discovery rate was investiga...
متن کاملAlgorithms for a class of infinite permutation groups
Motivated by the famous 3n + 1 conjecture, we call a mapping from Z to Z residue-class-wise affine if there is a positive integer m such that it is affine on residue classes (mod m). This article describes a collection of algorithms and methods for computation in permutation groups and monoids formed by residue-class-wise affine mappings.
متن کاملPermutation groups and transformation semigroups
In collaboration with João Araújo and others, I have been thinking about relations between permutation groups and transformation semigroups. In particular, what properties of a permutation group G on a set Ω guarantee that, if f is any non-permutation on Ω (or perhaps any non-permutation of rank k), then the transformation semigroup 〈G, f〉 has specified properties. There is far too much to summ...
متن کامل