The codegree isomorphism problem for finite simple groups II
Nguyen N. Hung, Alexander Moret\'o

TL;DR
This paper advances the understanding of the codegree isomorphism problem for finite simple groups by providing a unified approach and confirming the conjecture for multiple group families.
Contribution
It introduces a unified method to address the codegree isomorphism problem and verifies the conjecture for several classes of simple groups.
Findings
Confirmed the codegree conjecture for multiple simple group families.
Developed a unified approach to the codegree isomorphism problem.
Extended previous case-by-case analyses to broader group classes.
Abstract
Let be a nonabelian finite simple group. Huppert's conjecture asserts that if is a finite group with the same set of complex character degrees as , then for some abelian group . Over the past two decades, several specific cases of this conjecture have been addressed. Recently, attention has shifted to the analogous conjecture for character codegrees: if has the same set of character codegrees as , then . Unfortunately, both problems have primarily been examined on a case-by-case basis. In this paper and the companion [HM22], we present a more unified approach to the codegree conjecture and confirm it for several families of simple groups.
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 · Rings, Modules, and Algebras · Coding theory and cryptography
