Answers are grounded in this paper and cite their sources.
Fix t≥2. We first give an asymptotic formula for certain sums of the number of t-cores. We then use this result to compute the distribution of the size of the t-core of a uniformly random partition of an integer n. We show that this converges weakly to a gamma distribution after dividing by n. As a consequence, we find that the size of the t-core is of the order of n in expectation. We then apply this result to show that the probability that t divides the hook length of a uniformly random cell in a uniformly random partition equals 1/t in the limit. Finally, we extend this result to all modulo classes of t using abacus representations for cores and quotients.
No takes yet. Share an insight, caveat, or question.
Ayyer et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: