Hostname: page-component-89b8bd64d-j4x9h Total loading time: 0 Render date: 2026-05-09T10:14:13.059Z Has data issue: false hasContentIssue false
  • English
  • Français

Seminormal and subnormal subgroup lattices for transitive permutation groups

Part of: Permutation groups

Published online by Cambridge University Press:  09 April 2009

Cheryl E. Praeger
Cheryl E. Praeger
Affiliation:
School of Mathematics and Statistics, The University of Western Australia, 35 Stirling Highway, Crawley WA 6009, Australia, e-mail: praeger@maths.uwa.edu.au
Rights & Permissions [Opens in a new window]

Abstract

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.

Various lattices of subgroups of a finite transitive permutation group G can be used to define a set of ‘basic’ permutation groups associated with G that are analogues of composition factors for abstract finite groups. In particular G can be embedded in an iterated wreath product of a chain of its associated basic permutation groups. The basic permutation groups corresponding to the lattice L of all subgroups of G containing a given point stabiliser are a set of primitive permutation groups. We introduce two new subgroup lattices contained in L, called the seminormal subgroup lattice and the subnormal subgroup lattice. For these lattices the basic permutation groups are quasiprimitive and innately transitive groups, respectively.

Keywords

transitive permutation groupprimitivequasiprimitiveinnately transitivesubgroup latticesubnormal subgroup.

MSC classification

Secondary: 20B05: General theory for finite groups 20B10: Characterization theorems 20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures

Information

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 80 , Issue 1 , February 2006 , pp. 45 - 64
Copyright
Copyright © Australian Mathematical Society 2006

References

[1]Bailey, R. A., Praeger, C. E., Rowley, C. A. and Speed, T. P., ‘Generalized wreath products of permutation groups’, Proc. London Math. Soc. (3) 47 (1983), 69–82.CrossRefGoogle Scholar
[2]Bamberg, J. and Praeger, C. E., ‘Finite transitive permutation groups with a transitive minimal normal subgroup’, Proc. London Math. Soc. 89 (2004), 71–103.CrossRefGoogle Scholar
[3]Bhattacharjee, M., Macpherson, D., Möller, R. G. and Neumann, P. M., Notes on infinite permutation groups (Hindustan book agency, New Delhi, 1997).CrossRefGoogle Scholar
[4]Buekenhout, F., Delandtsheer, A., Doyen, J., Kleidman, P. B., Liebeck, M. W. and Saxl, J., ‘Linear spaces with flag-transitive automorphism groups’, Geometriae Dedicata 36 (1990), 89–94.Google Scholar
[5]Camina, A. R. and Praeger, C. E., ‘Line-transitive, point-quasiprimitive automorphism groups of finite linear spaces are affine or almost simple’, Aequationes Math. 61 (2001), 221–232.CrossRefGoogle Scholar
[6]Dixon, J. D. and Mortimer, B., Permutation groups (Springer, New York, 1996).CrossRefGoogle Scholar
[7]Lennox, J. C. and Stonehewer, S. E., Subnormal subgroups of groups (Clarendon Press, Oxford, 1987).Google Scholar
[8]Praeger, C. E., ‘An O'Nan-Scott theorem for finite quasiprimitive permutation groups and an application to 2-arc transitive graphs’, J. London Math. Soc. (2) 47 (1993), 227–239.CrossRefGoogle Scholar
[9]Praeger, C. E., ‘Finite quasiprimitive graphs’, in: Surveys in Combinatorics, 1997 (London) (ed. Bailey, R. A.), London Math. Soc. Lecture Note Ser. 241 (Cambridge Univ. Press, Cambridge, 1997) pp. 65–85.CrossRefGoogle Scholar
[10]Praeger, C. E., Saxl, J. and Yokoyama, K., ‘Distance transitive graphs and finite simple groups’, Proc. London Math. Soc. (3) 55 (1987), 1–21.CrossRefGoogle Scholar
[11]Schmidt, R., Subgroup lattices of groups (de Gruyter, Berlin, 1994).CrossRefGoogle Scholar