Conjectured variation of the three-colored partition identity for Q^_1(y)
Conjectured variation of the three-colored partition identity for Q^_1(y)
Let be the set of three-colored partitions, and let count the partitions of in having no occurrences of , where is the number of green or blue parts plus twice the number of red parts. Define
Here denotes the series occurring in Theorem 1. The conjectured variation is The conjectured variation.
This identity is suggested by computations as a variation of Theorem 1; the supplied text does not report a proof or a disproof.
Progress summary
A July 2026 paper appears to prove the identity, but its connection to this exact conjecture has not been independently verified.
The conjecture, stated by Matthew C. Russell in 2025, proposes the weighted three-colored partition identity . The original source reported computational evidence only, with no proof or disproof.
July 2026 claimed proof
A July 2026 preprint claims to confirm a related “Russell's conjecture”; its theorem, under the stated weighting of red parts by and other parts by , appears to match this identity in different notation. However, the available arXiv reading says the theorem concerns Russell's other conjecture and does not explicitly address , so the claimed resolution remains unverified.
Current status (as of August 2026): The identity was conjectural in 2025, and a July 2026 paper may contain a proof, but the exact identification with this conjecture is unsettled.
Sources
Sources & referencesView supporting material
Primary source
Matthew C. Russell, “On a pair of three-colored (mod 10) partition identities”, arXiv:2509.07169 (2025).
Solutions 1
Sign in to submit a 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 count the source's admissible three-colored partitions with no , marking each part by , each red part additionally by , and total size by . Let denote the analogous boundary class forbidding . Then the conjectured weighted generating function is
because a nonred part has weight , while a red part has weight .
The source's smallest-part decompositions, with the additional red marker retained, reduce to
Write . The stronger two-statistic formulas are
and
Both series have constant term . Indeed, writing the coefficients as , , equations (1) become
Substitution of (2)–(3) reduces these recurrences to
and
Hence the refinement holds identically as a formal power series.
Next, Euler's identity
reduces the source's triple sums to
Comparing (2) and (4) gives
The same reduction, by writing , canceling , and shifting , gives
The source's already proved atomic relation is
By (6), the right side of (7) is . Combining with (5) yields
exactly as conjectured. The source's proved equation (3.1) additionally gives
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 .