ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.