Abelian Carter subgroups in finite permutation groups
Enrico Jabara, Pablo Spiga

TL;DR
This paper proves that finite permutation groups with a regular abelian self-normalizing subgroup are necessarily soluble, advancing understanding of their structural properties.
Contribution
It establishes a new criterion linking the existence of a regular abelian self-normalizing subgroup to the solubility of finite permutation groups.
Findings
Finite permutation groups with such subgroups are soluble
Provides a structural characterization of these groups
Enhances classification of permutation groups based on subgroup properties
Abstract
We show that a finite permutation group containing a regular abelian self-normalizing subgroup is soluble.
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 · graph theory and CDMA systems
