On the polynomiality and asymptotics of moments of sizes for random $(n, dn\pm 1)$-core partitions with distinct parts
Huan Xiong, Wenston J.T. Zang

TL;DR
This paper investigates the moments of sizes of random core partitions with distinct parts, establishing polynomiality and asymptotic formulas, and confirms several conjectures related to these properties.
Contribution
It derives polynomiality results and asymptotic formulas for moments of core partitions with parameters $(n, dn\uplus 1)$, confirming conjectures and extending prior formulas.
Findings
Moments are asymptotically polynomial in n with degree at most 2k.
For $d=1$, the k-th moment of $X_{n,n+1}$ behaves like $(n^2/10)^k$ as n grows.
Explicit formulas for expectations of sizes of core partitions are provided.
Abstract
Amdeberhan's conjectures on the enumeration, the average size, and the largest size of -core partitions with distinct parts have motivated many research on this topic. Recently, Straub and Nath-Sellers obtained formulas for the numbers of and -core partitions with distinct parts, respectively. Let be the size of a uniform random -core partition with distinct parts when and are coprime to each other. Some explicit formulas for the -th moments and were given by Zaleski and Zeilberger when is small. Zaleski also studied the expectation and higher moments of and conjectured some polynomiality properties concerning them in arXiv:1702.05634. Motivated by the above works, we derive several polynomiality results and asymptotic formulas for the -th moments…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Identities · Advanced Combinatorial Mathematics · Analytic Number Theory Research
