Permutation groups and normal subgroups

Research output: Working paperPreprint

25 Downloads (Pure)

Abstract

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the traditional choice for this purpose, but some combinatorial applications require different kinds of basic groups, such as quasiprimitive groups, that are defined by properties of their normal subgroups. Quasiprimitive groups admit similar analyses to primitive groups, share many of their properties, and have been used successfully, for example to study $s$-arc transitive graphs. Moreover investigating them has led to new results about finite simple groups.
Original languageEnglish
Publication statusPublished - 15 Apr 2003

Publication series

NameProceedings of the ICM, Beijing

Fingerprint

Dive into the research topics of 'Permutation groups and normal subgroups'. Together they form a unique fingerprint.

Cite this