We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
We give a self-contained proof of the O'Nan-Scott Theorem for finite primitive permutation groups.
[1]Aschbacher, M. and Scott, L., ‘Maximal subgroups of finite groups’, J. Algebra92 (1985) 44–80.CrossRefGoogle Scholar
[2]
[2]Cameron, P. J., ‘Finite permutation groups and finite simple groups’, Bull. London Math. Soc.13 (1981), 1–22.CrossRefGoogle Scholar
[3]
[3]Kovács, L. G., ‘Maximal subgroups in composite finite groups’, J. Algebra99 (1986), 114–131.CrossRefGoogle Scholar
[4]
[4]Kovács, L. G., ‘Primitive permutaion groups of simple diagonal type’, ANU-MSRG Research Report 12, 1987.Google Scholar
[5]
[5]Kovács, L. G., Praeger, C. E. and Saxl, J., ‘On the reduction theorem for primitive permutaion groups’, in preparation.Google Scholar
[6]
[6]Liebeck, M. W., Praeger, C. E. and Saxi, J., ‘A classification of the maximal subgroups of the finite alternating and symmetric groups’, J. Algebra, to appear.Google Scholar
[7]
[7]Neumann, B. H., ‘Twisted wreath products of groups’, Arch. Math.14 (1963), 1–6.CrossRefGoogle Scholar
[8]
[8]Praeger, C. E., Saxi, J. and Yokoyama, K., ‘Distance transitive graphs and finite simple groups’, Proc. London Math. Soc. (3) 55 (1987), 1–21.CrossRefGoogle Scholar
[9]
[9]Scott, L. L., ‘Reprepsentations in characteristic p’, Santa Cruz conference on finite groups, pp. 318–331, Proc. Sympos. Pure Math., vol. 37, Amer. Math. Soc., Providence, R.I., 1980.Google Scholar
[10]
[10]Suzuki, M., Group theory I (Springer, Berlin-Heidelberg-New York, 1982).CrossRefGoogle Scholar