On Certain McKay Numbers of Symmetric Groups
Abstract
For primes and nonnegative integers a, we study the partition functions p(a;n):= \#\λ n : ord(H(λ))=a\, where H(λ) denotes the product of hook lengths of a partition λ. These partition values arise as the McKay numbers m(ord(n!) - a; Sn) in the representation theory of the symmetric group. We determine the generating functions for p(a;n) in terms of p(0;n) and specializations of specific D'Arcais polynomials. For = 2 and 3, we give an exact formula for the p(a;n) and prove that these values are zero for almost all n. For larger primes , the p(a;n) are positive for sufficiently large n. Despite this positivity, we prove that p(a;n) is almost always divisible by m for any integer m. Furthermore, with these results we prove several Ramanujan-type congruences. These include the congruences p(a;k n - δ(a,)) 0 k+1, for 0<a< , where = 5, 7, 11 and δ(a,) := (2 - 1)/24 + a, which answer a question of Ono.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.