Distribution of hooks in self-conjugate partitions
William Craig, Ken Ono, Ajit Singh
TL;DR
This work establishes that the distribution of the number of $t$-hooks in self-conjugate partitions of size $n$ is asymptotically normal, with explicit leading terms for the mean and variance that depend on $t$ through a parity-based indicator $δ_t$. The authors develop a two-variable generating function $F_t(T;q)$ via the Littlewood bijection and a detailed $q$-series analysis, combining generating-function methods, the dilogarithm, Euler–Maclaurin summation, and saddle-point techniques. They first derive asymptotics for $sc_t(n;T)$ across ranges of $T$, then, through the method of moments, prove the central limit behavior for self-conjugate partitions as $n \to \infty$. A key finding is that the main term of the mean matches the unrestricted-case result while the variance term is doubled in the self-conjugate setting, highlighting how shape constraints alter probabilistic hook statistics. The results deepen connections between partition hook lengths, modular-type $q$-series identities, and probabilistic limits in restricted partition families, with potential implications for related combinatorial and representation-theoretic phenomena.
Abstract
We confirm the speculation that the distribution of $t$-hooks among unrestricted integer partitions essentially descends to self-conjugate partitions. Namely, we prove that the number of hooks of length $t$ among the size $n$ self-conjugate partitions is asymptotically normally distributed with mean $μ_t(n) \sim \frac{\sqrt{6n}}π + \frac{3}{π^2} - \frac{t}{2}+\frac{δ_t}{4}$ and variance $σ_t^2(n) \sim \frac{(π^2 - 6) \sqrt{6n}}{π^3},$ where $δ_t:=1$ if $t$ is odd, and is 0 otherwise.
