The partition characterization of the Andrews–Gordon companion identities

About 5 years old · traced to

Let r≥2r\geq 2 and 1≤i≤r1\leq i\leq r. Let Cr,i\mathcal{C}_{r,i} be the set of partitions λ=(λ1,…,λs)\lambda=(\lambda_1,\dots,\lambda_s) with at most i−1i-1 parts equal to 11 and satisfying either Nr,i(λ)<r−1N_{r,i}(\lambda)<r-1, or Nr,i(λ)=r−1N_{r,i}(\lambda)=r-1 and

s≤∑j=1r−1pi,j(λ)−(r−i).s\leq \sum_{j=1}^{r-1}p_{i,j}(\lambda)-(r-i).

For a nonnegative integer nn, let Cr,i(n)C_{r,i}(n) be the number of partitions of nn in Cr,i\mathcal{C}_{r,i}; let Tr,i(n)T_{r,i}(n) and Er,i(n)E_{r,i}(n) denote the corresponding quantities defined in the paper. The partition characterization conjecture. For every nonnegative integer nn,

Cr,i(n)=Tr,i(n)=Er,i(n).C_{r,i}(n)=T_{r,i}(n)=E_{r,i}(n).

This conjecture gives a combinatorial interpretation of the Hilbert-series coefficients arising from the commutative-algebra approach to companions of the Andrews–Gordon identities. Its status is not resolved in the supplied source material.

References

Primary source

Pooneh Afsharijoo, Jehanne Dousse, Frédéric Jouhet and Hussein Mourtada, “New companions to the Andrews–Gordon identities motivated by commutative algebra”, arXiv:2104.09422 (2023).

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.