Skip to main content
Log in

On the polynomiality and asymptotics of moments of sizes for random (n, dn ± 1)-core partitions with distinct parts

  • Articles
  • Published:
Science China Mathematics Aims and scope Submit manuscript

Abstract

Amdeberhan’s conjectures on the enumeration, the average size, and the largest size of (n,n+1)-core partitions with distinct parts have motivated many research on this topic. Recently, Straub (2016) and Nath and Sellers (2017) obtained formulas for the numbers of (n, dn − 1) and (n, dn+1)-core partitions with distinct parts, respectively. Let Xs,t be the size of a uniform random (s, t)-core partition with distinct parts when s and t are coprime to each other. Some explicit formulas for the k-th moments E[X kn,n+1 ] and E[X k2n+1,2n+3 ] were given by Zaleski and Zeilberger (2017) when k is small. Zaleski (2017) also studied the expectation and higher moments of Xn,dn−1 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 k-th moments of Xn,dn+1 and Xn,dn−1 in this paper, by studying the β-sets of core partitions. In particular, we show that these k-th moments are asymptotically some polynomials of n with degrees at most 2k, when d is given and n tends to infinity. Moreover, when d = 1, we derive that the k-th moment E[X kn,n+1 ] of Xn,n+1 is asymptotically equal to (n2/10)k when n tends to infinity. The explicit formulas for the expectations E[Xn,dn+1] and E[Xn,dn−1] are also given. The (n,dn−1)-core case in our results proves several conjectures of Zaleski (2017) on the polynomiality of the expectation and higher moments of Xn,dn−1.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Amdeberhan T. Theorems, problems and conjectures. ArXiv:1207.4045, 2012

  2. Amdeberhan T, Leven E. Multi-cores, posets, and lattice paths. Adv Appl Math, 2015, 71: 1–13

    Article  MathSciNet  Google Scholar 

  3. Anderson J. Partitions which are simultaneously t 1 - and t 2-core. Discrete Math, 2002, 248: 237–243

    Article  MathSciNet  Google Scholar 

  4. Armstrong D, Hanusa CRH, Jones B. Results and conjectures on simultaneous core partitions. European J Combin, 2014, 41: 205–220

    Article  MathSciNet  Google Scholar 

  5. Baek J, Nam H, Yu M. A bijective proof of Amdeberhan’s conjecture on the number of (s, s + 2)-core partitions with distinct parts. Discrete Math, 2018, 341: 1294–1300

    Article  MathSciNet  Google Scholar 

  6. Berge C. Principles of Combinatorics. Mathematics in Science and Engineering, vol. 72. New York: Academic Press, 1971

    MATH  Google Scholar 

  7. Chen W, Huang H, Wang L. Average size of a self-conjugate s, t-core partition. Proc Amer Math Soc, 2016, 144: 1391–1399

    Article  MathSciNet  Google Scholar 

  8. Ekhad S B, Zeilberger D. Explicit expressions for the variance and higher moments of the size of a simultaneous core partition and its limiting distribution. In the Personal Journal of Shalosh B. Ekhad and Doron Zeilberger, http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/stcore.html

  9. Ford B, Mai H, Sze L. Self-conjugate simultaneous p- and q-core partitions and blocks of A n. J Number Theory, 2009, 129: 858–865

    Article  MathSciNet  Google Scholar 

  10. Johnson P. Lattice points and simultaneous core partitions. Electron J Combin, 2018, 25: Paper 3.47

  11. Keith W J, Nath R. Partitions with prescribed hooksets. J Comb Number Theory, 2011, 3: 39–50

    MathSciNet  MATH  Google Scholar 

  12. Macdonald I G. Symmetric Functions and Hall Polynomials, 2nd ed. Oxford Mathematical Monographs. New York: The Clarendon Press, Oxford University Press, 1995

    MATH  Google Scholar 

  13. Nath R, Sellers J A. A combinatorial proof of a relationship between largest (2k − 1, 2k + 1) and (2k − 1, 2k, 2k +1)-cores. Electron J Combin, 2016, 23: Paper 1.13

  14. Nath R, Sellers J A. Abaci structures of (s, ms ± 1)-core partitions. Electron J Combin, 2017, 24: Paper 1.5

  15. Nath R. Symmetry in maximal (s − 1, s + 1) cores. Integers, 2016, 16: A18

    MathSciNet  MATH  Google Scholar 

  16. Olsson J, Stanton D. Block inclusions and cores of partitions. Aequationes Math, 2007, 74: 90–110

    Article  MathSciNet  Google Scholar 

  17. Paramonov K. Cores with distinct parts and bigraded Fibonacci numbers. Discrete Math, 2018, 341: 875–888

    Article  MathSciNet  Google Scholar 

  18. Stanley R P. Enumerative Combinatorics. Volume 2. New York-Cambridge: Cambridge University Press, 1999

    Book  Google Scholar 

  19. Stanley R P, Zanello F. The Catalan case of Armstrong’s conjectures on simultaneous core partitions. SIAM J Discrete Math, 2015, 29: 658–666

    Article  MathSciNet  Google Scholar 

  20. Straub A. Core partitions into distinct parts and an analog of Euler’s theorem. European J Combin, 2016, 57: 40–49

    Article  MathSciNet  Google Scholar 

  21. Wang V. Simultaneous core partitions: Parameterizations and sums. Electron J Combin, 2016, 23: Paper 1.4

  22. Xiong H. The number of simultaneous core partitions. ArXiv:1409.7038, 2014

  23. Xiong H. On the largest size of (t, t +1, …, t + p)-core partitions. Discrete Math, 2016, 339: 308–317

    Article  MathSciNet  Google Scholar 

  24. Xiong H. On the largest sizes of certain simultaneous core partitions with distinct parts. European J Combin, 2018, 71: 33–42

    Article  MathSciNet  Google Scholar 

  25. Xiong H. Core partitions with distinct parts. Electron J Combin, 2018, 25: Paper 1.57

  26. Yan S, Qin G, Jin Z, et al. On (2k + 1, 2k + 3)-core partitions with distinct parts. Discrete Math, 2017, 340: 1191–1202

    Article  MathSciNet  Google Scholar 

  27. Yang J, Zhong M, Zhou R. On the enumeration of (s, s + 1, s + 2)-core partitions. European J Combin, 2015, 49: 203–217

    Article  MathSciNet  Google Scholar 

  28. Zaleski A. Explicit expressions for the moments of the size of an (s, s + 1)-core partition with distinct parts. Adv Appl Math, 2017, 84: 1–7

    Article  MathSciNet  Google Scholar 

  29. Zaleski A. Explicit expressions for the moments of the size of an (n, dn − 1)-core partition with distinct parts. ArXiv:1702.05634, 2017

  30. Zaleski A, Zeilberger D. Explicit expressions for the expectation, variance and higher moments of the size of a (2n + 1, 2n + 3)-core partition with distinct parts. J Difference Equ Appl, 2017, 23: 1241–1254

    Article  MathSciNet  Google Scholar 

  31. Zeilberger D. The automatic central limit theorems generator (and much more!). In: Proceedings of the Waterloo Workshop in Computer Algebra 2008. Advances in Combinatorial Mathematics. Berlin: Springer, 2010, 165–174

    MATH  Google Scholar 

Download references

Acknowledgements

This work was supported by Swiss National Science Foundation (Grant No. P2ZHP2_171879). This work was done during the first author’s visit to the Harbin Institute of Technology (HIT). The first author thanks Professor Quanhua Xu and the second author for the hospitality. The authors really appreciate the helpful suggestions given by referees for improving the overall quality of the manuscript.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Huan Xiong.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xiong, H., Zang, W.J.T. On the polynomiality and asymptotics of moments of sizes for random (n, dn ± 1)-core partitions with distinct parts. Sci. China Math. 64, 869–886 (2021). https://doi.org/10.1007/s11425-018-9500-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11425-018-9500-x

Keywords

MSC(2010)

Navigation