primitive permutation group
Let be a set, and a transitive permutation group on . Then is said to be a primitive permutation group if it has no nontrivial blocks (http://planetmath.org/BlockSystem).
For example, the symmetric group is a primitive permutation group on .
Note that is not a primitive permutation group on the vertices of a square, because the pairs of opposite points form a nontrivial block.
It can be shown that a transitive permutation group on a set is primitive if and only if the stabilizer is a maximal subgroup of for all .
Title | primitive permutation group |
---|---|
Canonical name | PrimitivePermutationGroup |
Date of creation | 2013-03-22 14:00:49 |
Last modified on | 2013-03-22 14:00:49 |
Owner | Thomas Heye (1234) |
Last modified by | Thomas Heye (1234) |
Numerical id | 20 |
Author | Thomas Heye (1234) |
Entry type | Definition |
Classification | msc 20B15 |