Conjectured variation of the three-colored partition identity for Q^_1(y)

About 1 year old · traced to

Let Γ\Gamma be the set of three-colored partitions, and let A1∗(m,n)A^\ast_1(m,n) count the partitions of nn in Γ\Gamma having no occurrences of 1R1_{\textcolor{Red}{\bf R}}, where mm is the number of green or blue parts plus twice the number of red parts. Define

Q1∗(y)=∑m,n≥0A1∗(m,n)ymqn.Q^\ast_1(y)=\sum_{m,n\geq 0}A^\ast_1(m,n)y^m q^n.

Here S3,0,1(y)S_{3,0,1}(y) denotes the series occurring in Theorem 1. The conjectured variation is The conjectured variation.

Q1∗(y)=(1+yq)S3,0,1(y).Q^\ast_1(y)=(1+yq)S_{3,0,1}(y).

This identity is suggested by computations as a variation of Theorem 1; the supplied text does not report a proof or a disproof.

References

Primary source

Matthew C. Russell, “On a pair of three-colored (mod 10) partition identities”, arXiv:2509.07169 (2025).

Progress summary

Refreshed
Claimed solved

A July 2026 preprint claims to confirm the conjecture, and a posted derivation gives a complete proof, but neither has been independently verified.

Matthew C. Russell stated in 2025 that computations suggest the three-colored partition identity Q1∗(y)=(1+yq)S3,0,1(y)Q^\ast_1(y)=(1+yq)S_{3,0,1}(y). His source presents it as a conjecture, without proof or disproof.

July 2026 claimed confirmation

Shane Chern's July 4, 2026 preprint says its multivariate generating-function identities confirm a Russell conjecture and give a stronger three-color refinement. The retrieved text does not explicitly identify that conjecture with this exact Q1∗(y)Q^\ast_1(y) identity, so the claimed resolution remains unverified.

Posted attempt

A posted derivation claims a complete proof by introducing independent markers for the number of parts and red parts, proving coefficient recurrences, and reducing the result to established series identities. The attempt has not been independently verified.

Current status (as of August 2026): The identity remains unverified, while Chern's preprint and a posted derivation claim that it follows from stronger generating-function identities.

Sources

Solutions 1

ProofThis solution needs a summarySee full solutionHide full solution

Prior proof and attribution. This conjecture was already proved by Shane Chern, Linked partition ideals and Russell's three-colored partitions, https://arxiv.org/abs/2607.03977 , Theorem 1.2 and Section 6. Its Theorem 1.1 proves an even stronger refinement with all three colors marked independently. Therefore the original problem is not open; the text below is only an alternative derivation and does not claim the first proof or priority for its refinement.

Proof, with a stronger independent refinement by the number of red parts.

Let A1(x,z)A_1(x,z) count the source's admissible three-colored partitions with no 1R1_R, marking each part by xx, each red part additionally by zz, and total size by qq. Let A3(x,z)A_3(x,z) denote the analogous boundary class forbidding 1R,2R,1B1_R,2_R,1_B. Then the conjectured weighted generating function is

Q1∗(y)=A1(y,y),Q_1^*(y)=A_1(y,y),

because a nonred part has weight yy, while a red part has weight y2y^2.

The source's smallest-part decompositions, with the additional red marker retained, reduce to

A1(x,z)=(1+xq)A1(xq,z)+xqA1(xq2,z)+xzq2A3(xq2,z),A3(x,z)=xqA3(xq,z)+A1(xq,z).(1)\begin{aligned} A_1(x,z) &=(1+xq)A_1(xq,z) +xqA_1(xq^2,z) +xzq^2A_3(xq^2,z),\\ A_3(x,z) &=xqA_3(xq,z)+A_1(xq,z). \end{aligned} \tag{1}

Write TL=L(L+1)/2T_L=L(L+1)/2. The stronger two-statistic formulas are

[xLzr]A1(x,z)=qTL+r2(−q;q)L−1(1+qr)(q2;q2)r(q;q)L−r(L≥1, 0≤r≤L),(2)\boxed{ [x^Lz^r]A_1(x,z) = \frac{ q^{T_L+r^2}(-q;q)_{L-1}(1+q^r) }{ (q^2;q^2)_r(q;q)_{L-r} } } \quad(L\ge1,\ 0\le r\le L), \tag{2}

and

[xLzr]A3(x,z)=qTL+r(r+1)(−q;q)L(q2;q2)r(q;q)L−r(L≥0, 0≤r≤L).(3)\boxed{ [x^Lz^r]A_3(x,z) = \frac{ q^{T_L+r(r+1)}(-q;q)_L }{ (q^2;q^2)_r(q;q)_{L-r} } } \quad(L\ge0,\ 0\le r\le L). \tag{3}

Both series have constant term 11. Indeed, writing the coefficients as aL,ra_{L,r}, cL,rc_{L,r}, equations (1) become

(1−qL)aL,r=(qL+q2L−1)aL−1,r+q2LcL−1,r−1,(1-q^L)a_{L,r} =(q^L+q^{2L-1})a_{L-1,r} +q^{2L}c_{L-1,r-1}, cL,r=qL(aL,r+cL−1,r).c_{L,r}=q^L(a_{L,r}+c_{L-1,r}).

Substitution of (2)–(3) reduces these recurrences to

qL−r(1+qr)+(1−qL−r)1+qL=1\frac{q^{L-r}(1+q^r)+(1-q^{L-r})}{1+q^L}=1

and

(1−qL)(1+qr)=(1+qr)(1−qL−r)+qL−r(1−q2r).(1-q^L)(1+q^r) =(1+q^r)(1-q^{L-r}) +q^{L-r}(1-q^{2r}).

Hence the refinement holds identically as a formal power series.

Next, Euler's identity

∑j+k=Mqk(q2;q2)j(q2;q2)k=1(q;q)M\sum_{j+k=M} \frac{q^k}{(q^2;q^2)_j(q^2;q^2)_k} =\frac1{(q;q)_M}

reduces the source's triple sums to

Sa,b,b+1(y)=∑L≥0∑r=0LyL+rqTL+r(r−1+a)+b(L−r)(−q;q)L(q2;q2)r(q;q)L−r.(4)S_{a,b,b+1}(y) = \sum_{L\ge0}\sum_{r=0}^L \frac{ y^{L+r} q^{T_L+r(r-1+a)+b(L-r)} (-q;q)_L }{ (q^2;q^2)_r(q;q)_{L-r} }. \tag{4}

Comparing (2) and (4) gives

Q1∗(y)=S1,0,1(y)+yqS3,1,2(y).(5)Q_1^*(y) =S_{1,0,1}(y)+yqS_{3,1,2}(y). \tag{5}

The same reduction, by writing M=j+kM=j+k, canceling 1−qM1-q^M, and shifting M↦M+1M\mapsto M+1, gives

S3,0,1−S3,1,2=yqS4,1,2+yq2S5,2,3.(6)S_{3,0,1}-S_{3,1,2} =yqS_{4,1,2}+yq^2S_{5,2,3}. \tag{6}

The source's already proved atomic relation is

S1,0,1−S3,0,1=y2q2S4,1,2+y2q3S5,2,3.(7)S_{1,0,1}-S_{3,0,1} =y^2q^2S_{4,1,2}+y^2q^3S_{5,2,3}. \tag{7}

By (6), the right side of (7) is yq(S3,0,1−S3,1,2)yq(S_{3,0,1}-S_{3,1,2}). Combining with (5) yields

Q1∗(y)=(1+yq)S3,0,1(y),\boxed{ Q_1^*(y) =(1+yq)S_{3,0,1}(y), }

exactly as conjectured. The source's proved equation (3.1) additionally gives

Q1∗(y)=(−yq;q)∞∑r≥0yrqr2(q;q)r.\boxed{ Q_1^*(y) =(-yq;q)_\infty \sum_{r\ge0}\frac{y^rq^{r^2}}{(q;q)_r}. }

Formulas (2)–(3) are strictly stronger: they keep the number of parts and the number of red parts independent.

Source: Matthew C. Russell, On a pair of three-colored (mod 10) partition identities, The Ramanujan Journal 70, article 28 (2026), Conjecture 3, https://doi.org/10.1007/s11139-026-01375-9 ; https://arxiv.org/abs/2509.07169 .