Abstract
Fix . 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 . As a consequence, we find that the size of the t-core is of the order of 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 in the limit. Finally, we extend this result to all modulo classes of t using abacus representations for cores and quotients.
Funding Statement
The authors were partially supported by the UGC Centre for Advanced Studies.
The first author was also partly supported by Department of Science and Technology grant EMR/2016/006624.
Acknowledgments
This research was driven by computer exploration using the open-source mathematical software Sage [6]. We thank D. Grinberg for suggesting the idea of the proof of Lemma 5.16 and an anonymous referee for many useful comments and corrections.
Citation
Arvind Ayyer. Shubham Sinha. "The size of t-cores and hook lengths of random cells in random partitions." Ann. Appl. Probab. 33 (1) 85 - 106, February 2023. https://doi.org/10.1214/22-AAP1809
Information