Conjectured arithmetic congruences for the 9-color overpartition function
Let denote the -color overpartition function, and let and . Arithmetic congruence conjecture. For all and ,
These are presented as conjectured arithmetic properties based on the paper's computations; no proof or resolution is supplied.
References
Primary source
H. S. Sumanth Bharadwaj, N. Sujatha and S. Chandankumar, “Arithmetic properties of the 2-color overpartition function p_(n)”, arXiv:2607.16608 (2026).
Additional references
7 papers in this index state this conjecture (2013–2026). The statement above is taken from the most recent of them; the others are arXiv:2412.19998, arXiv:2307.04687, arXiv:2307.02579, arXiv:2101.04058, arXiv:1801.06990, arXiv:1304.0684.
Progress summary
A reader-submitted complete proof attempt claims both conjectures are true, but no independent verification has appeared.
The July 2026 preprint by H. S. Sumanth Bharadwaj, N. Sujatha, and S. Chandankumar records the congruences for modulo and modulo as conjectures based on computation, without supplying proofs.
Posted attempt
A complete proof attempt claims both congruences, strengthens the first to for every , and sketches a modular-form/Sturm-bound verification of the second. The attempt has not been independently verified.
Current status (as of August 2026): Both congruences have an unverified complete-proof claim, but neither is mathematically settled.
Sources
Solutions 1
ProofThis solution needs a summarySee full solution
Both congruences hold. In fact, the first extends to every parameter and every exponent , strengthening both restrictions in the conjecture:
and
For the first identity, put
The theta identity gives
and consequently, modulo ,
Its terms count representations by at most three positive weighted squares, with weights .
Write . If , any representation of by at most three weighted squares has every root divisible by . Dividing yields a representation of by at most three residues from , which is impossible.
If , dividing roots by leaves , which is neither a weighted square nor a sum of two weighted squares. For each cubic term in (1), swap two roots of the same weight. A fixed point would satisfy
Necessarily and is odd, so
contradicting . Therefore every cubic coefficient is even, and its factor makes it vanish modulo . This proves the stronger all-, all- theorem.
For the second congruence, write . The source's exact three-dissection gives
The target corresponds to exponents of . Form the eta quotient
At level , its eta exponent vector is
The weighted eta sums are
At cusp denominators , the orders are respectively
Hence is holomorphic of weight , level , and character .
Project onto residue using all four Dirichlet characters modulo :
Primitive twisting and the standard oldform correction for imprimitive characters show
The subgroup index is , giving the complete Sturm bound
The required exact finite certificate is reproducible entirely with integer arithmetic:
and
Computing through
gives
These exact coefficients cover the full Sturm bound after the shift and multiplication by the unit . Therefore
identically by Sturm's theorem. Dividing its coefficients by and removing the residue-preserving unit proves the desired modulo- congruence for every .
Source: H. S. Sumanth Bharadwaj, N. Sujatha and S. Chandankumar, arXiv:2607.16608, equation (3.3) and Conjecture 3, equations (5.7)–(5.8).