Normal $p$-complements and irreducible character codegrees
Jiakuan Lu, Yu Li, Boru Zhang

TL;DR
This paper proves that if all irreducible character codegrees associated with a normal subgroup are not divisible by a fixed prime, then the subgroup has a normal p-complement and is solvable.
Contribution
It establishes a new criterion linking character codegrees to the existence of normal p-complements and solvability of subgroups.
Findings
Normal p-complement exists under the given codegree condition.
Subgroup N is solvable if codegrees are not divisible by p.
Provides a character-theoretic criterion for subgroup structure.
Abstract
Let be a finite group and , and let Irr be the set of all irreducible complex characters of . Let , we write , and called it the codegree of the irreducible character . Let , write , and In this Ipaper, we prove that if and every member of is not divisible by some fixed prime , then has a normal -complement and is solvable.
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 · Cooperative Communication and Network Coding
