The size of t-cores and hook lengths of random cells in random partitions
Abstract
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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.