Math 2.0

Group theory and generalizations Group actions and permutation groups Concept

Primitive permutation group

Summary

A permutation group is primitive when it is transitive and preserves no nontrivial block system, that is, no nontrivial splitting of the set into parts. Primitive groups are the building blocks of all finite permutation groups. A transitive group of degree nn that is not primitive embeds in a wreath product Sk≀SmS_k \wr S_m with km=nkm = n and 1<k,m<n1 < k, m < n. A transitive group is primitive exactly when its point stabilisers are maximal subgroups. The O'Nan–Scott theorem sorts the finite primitive groups into a few types.

Where this leads

4 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Primitive_permutation_group
About this page
TagY10S0751KG
URIm2://Y10S0751KG
Kindconcept
WritingW0 stub
MSC20B15
SpecializesPermutation group
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by

Results about this

Definitions