The infinite cylindric-partition generating-function hierarchy

From papers

For k4k\geq 4 and ki1k\geq i\geq 1, let CP(a,b)(n)CP_{(a,b)}(n) denote the generating function for cylindric partitions with profile (a,b)(a,b), as defined earlier in the paper.

Cylindric-partition hierarchy conjecture.

CP(2ki,i1)(n)=1(q;q)2nr=(1)rqr((2k+1)r+2k2i+1)2[2nn(2k+1)r2+(2k2i+1)(1)r14]q,CP_{(2k-i,i-1)}(n)=\frac{1}{(q;q)_{2n}}\sum_{r=-\infty}^{\infty}(-1)^r q^{\frac{r((2k+1)r+2k-2i+1)}{2}}{2n\brack n-\frac{(2k+1)r}{2}+(2k-2i+1)\frac{(-1)^r-1}{4}}_q, CP(2ki1,i1)(n)=1(q;q)2nr=(1)rqr(kr+ki)[2nnkr+(ki)(1)r12]q.CP_{(2k-i-1,i-1)}(n)=\frac{1}{(q;q)_{2n}}\sum_{r=-\infty}^{\infty}(-1)^r q^{r(kr+k-i)}{2n\brack n-kr+(k-i)\frac{(-1)^r-1}{2}}_q.

These formulas extend the generating-function identities established for smaller values of kk, including the cases treated by direct computer algebra. General proofs are not known.

Progress summary

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

Sources & referencesView supporting material

Primary source

Runqiao Li and Ali K. Uncu, “A MacMahon Analysis View of Cylindric Partitions”, arXiv:2501.19272 (2025).

Solutions 0

No solutions have been posted yet.