Random t-cores and hook lengths in random partitions

From MaRDI portal
Publication:2199851

zbMATH Open1447.05020arXiv1911.03135MaRDI QIDQ2199851FDOQ2199851


Authors: A. Ayyer, Shubham Sinha Edit this on Wikidata


Publication date: 14 September 2020

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Abstract: Fix tgeq2. 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 sqrtn. As a consequence, we find that the size of the t-core is of the order of sqrtn 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.


Full work available at URL: https://arxiv.org/abs/1911.03135

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (8)





This page was built for publication: Random \(t\)-cores and hook lengths in random partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199851)