Group factorisations, uniform automorphisms, and permutation groups of simple diagonal type
Cheryl E. Praeger, Csaba Schneider

TL;DR
This paper provides a new, classification-independent proof that quasiprimitive permutation groups of simple diagonal type cannot embed into wreath products in product action, using deep results on factorisations and automorphisms.
Contribution
It introduces a novel proof method applicable to both finite and infinite groups, linking factorisations and automorphisms to group embedding properties.
Findings
Quasiprimitive groups of simple diagonal type cannot embed into wreath products in product action.
Factorisations involving subdirect subgroups are governed by uniform automorphisms.
The proof is independent of the finite simple group classification.
Abstract
We present a new proof, which is independent of the finite simple group classification and applies also to infinite groups, that quasiprimitive permutation groups of simple diagonal type cannot be embedded into wreath products in product action. The proof uses several deep results that concern factorisations of direct products involving subdirect subgroups. We find that such factorisations are controlled by the existence of uniform automorphisms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography
