Permutation groups and normal subgroups
| dc.creator | Praeger, Cheryl E. | |
| dc.date | 2003-04-15 | |
| dc.date.accessioned | 2026-07-07T04:56:55Z | |
| dc.date.available | 2026-07-07T04:56:55Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/math/0304207 | |
| dc.identifier | http://arxiv.org/abs/math/0304207 | |
| dc.identifier | Proceedings of the ICM, Beijing 2002, vol. 2, 67--76 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/67094 | |
| dc.subject | Group Theory | |
| dc.subject | 20B05, 20B10 20B25, 05C25 | |
| dc.title | Permutation groups and normal subgroups | |
| dc.type | text |