The McKay Conjecture on character degrees
Marc Cabanes, Britta Sp\"ath

TL;DR
This paper proves McKay's conjecture relating the number of irreducible characters of prime-to-ell degree in finite groups to normalizers of Sylow ell-subgroups, completing a reduction to simple groups using classification.
Contribution
It completes the proof of McKay's conjecture by verifying a key reduction step for finite simple groups of type D, using detailed character analysis of specific subgroups.
Findings
Proved McKay's conjecture for all finite groups.
Characterized the irreducible characters of certain reductive subgroups.
Showed the action of automorphisms on these characters.
Abstract
We prove that for any prime , any finite group has as many irreducible complex characters of degree prime to as the normalizers of its Sylow -subgroups. This equality was conjectured by John McKay. The conjecture was reduced by Isaacs--Malle--Navarro (2007) to a conjecture on representations, linear and projective, of finite simple groups that we finish proving here using the classification of those groups. We study mainly characters of normalizers N of Sylow -tori () in a simply-connected algebraic group of type D () for which is a Frobenius endomorphism. We also introduce a certain class of -stable reductive subgroups of maximal rank where is of type some DD. The finite groups are an…
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 · semigroups and automata theory
