Universal families of permutation groups.
From MaRDI portal
A family \(\mathcal F\) of finite permutation groups is called `universal' if each finite group is isomorphic to a 2-point stabiliser of a member of \(\mathcal F\). The author describes five families of finite permutation groups which are universal. In each example moreover, each finite group is isomorphic to a 2-point stabiliser of infinitely many members of \(\mathcal F\). The proofs are quite technical.
Recommendations
- scientific article; zbMATH DE number 4114857
- scientific article; zbMATH DE number 6194182
- Characterizing a family of elusive permutation groups
- On permuteral subgroups in finite groups.
- On permutable subgroups of finite groups.
- Permutation groups: theory and applications.
- Permutation groups and close-knit families of sets
- scientific article; zbMATH DE number 5155097
- Permutation groups defined by unordered relations.
Cites work
- Arbitrary groups as two-point stabilisers of symmetric groups acting on partitions
- Automorphisms and isomorphisms of symmetric and affine designs
- scientific article; zbMATH DE number 863496 (Why is no real title available?)
- Probabilistic generation of finite simple groups
- Random Permutations: Some Group-Theoretic Aspects
- Structure and automorphism groups of Hadamard designs
- Two point stabilisers of partition actions of linear groups
Cited in
(4)
This page was built for publication: Universal families of permutation groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1016019)
