Factorizations of primitive permutation groups

The author gives a complete classification of those finite primitive permutation groups which admit a factorization as a product of a point stabilizer and an automorphic image of it: \(G=G_\omega G^\alpha_\omega\). Using the types given in the O'Nan-Scott theorem the following cases are obtained: (i) If \(G\) is affine then \(G=(E_{2^3}L_3(2))\text{ wr }X\) where \(X\) is a transitive permutation group. (ii) If \(G\) is almost simple then the socle and the degree of \(G\) is one of the following: \(P\Omega^+_8(q)\), \(q^4(q^4-1)\); \(Sp_4(q)\), \(q^2(q^2-1)/2\) with \(q>2\) even; \(A_6\), \(6\); \(M_{12}\), \(12\). (iii) If \(G\) is a blow-up then \(G\) is a blow-up of one of the groups from case (ii). (In the paper more information about the possible groups \(G\) is given.) No required factorization exists if \(G\) is of diagonal type or of twisted product action type. The main ingredients of the proof are the list of maximal factorizations of the finite simple groups by \textit{M. W. Liebeck}, \textit{C. E. Praeger} and \textit{J. Saxl} [Mem. Am. Math. Soc. 432 (1990; Zbl 0703.20021)], \textit{M. Aschbacher}'s classification of maximal subgroups of the finite simple classical groups [Invent. Math. 76, 469-514 (1984; Zbl 0537.20023)], and two unpublished results from the author's recent Ph.D. thesis. The main theorem is also applied to characterize flag-transitive grids.

Recommendations

Cites work

Cited in

(22)

This page was built for publication: Factorizations of primitive permutation groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1368048)