Polynomiality and degree of pre-moments in the parameter dd

At least 8 years old · documented by

Let Xd,nX_{d,n} be the size of a uniformly random (n,dn−1)(n,dn-1)-core partition with distinct parts. For a natural number kk, let Gd,n(q)G_{d,n}(q) be the generating function of Xd,nX_{d,n} and define its kkth pre-moment by

mk(d,n):=[(qddq)kGd,n(q)]q=1.m_k(d,n):=\left[\left(q\frac{d}{dq}\right)^kG_{d,n}(q)\right]_{q=1}.

Polynomial pre-moment conjecture. For each nn, the kkth pre-moment mk(d,n)m_k(d,n) of Xd,nX_{d,n} is a polynomial in dd. Further, the degree of this polynomial is 2k+⌊n/2⌋2k+\lfloor n/2\rfloor.

Such polynomial formulas would give explicit control of all moments when nn is fixed and dd varies. The claim is presented as an experimental observation, with no proof or resolution supplied in the source.

References

Primary source

Anthony Zaleski, “Explicit expressions for the moments of the size of an (n, dn-1)-core partition with distinct parts”, arXiv:1702.05634 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.