On the Characterization of Sporadic Simple Groups by Codegrees
Mallory Dolorfino, Luke Martin, Zachary Slonim, Yuxuan Sun, Yong Yang

TL;DR
This paper proves that each of the 26 sporadic simple groups can be uniquely identified by its set of codegrees, providing a new characterization of these groups.
Contribution
It establishes that the codegree set uniquely determines each sporadic simple group among all finite groups.
Findings
Each sporadic simple group is uniquely characterized by its codegree set.
The codegree set serves as a complete invariant for identifying sporadic simple groups.
The result enhances understanding of the structure of sporadic groups through character theory.
Abstract
Let be a finite group and the set of all irreducible complex characters of . Define the codegree of as and denote by the codegree set of . Let be one of the sporadic simple groups. In this paper, we show that is determined up to isomorphism by cod.
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
