← All problems

Congruence conjecture for prime-colored overpartitions

3 years old · traced to

Let p‾−q(n)\overline{p}_{-q}(n) denote the number of qq-colored overpartitions of nn, where qq is prime. Congruence conjecture. For all n≥0n\geq 0 and primes qq, one has

p‾−q(8n+1)≡0(mod2),p‾−q(8n+2)≡0(mod4),p‾−q(8n+3)≡0(mod8),p‾−q(8n+4)≡0(mod2),p‾−q(8n+5)≡0(mod8),p‾−q(8n+6)≡0(mod8),p‾−q(8n+7)≡0(mod32).\begin{aligned} \overline{p}_{-q}(8n+1) &\equiv 0 \pmod{2},\\ \overline{p}_{-q}(8n+2) &\equiv 0 \pmod{4},\\ \overline{p}_{-q}(8n+3) &\equiv 0 \pmod{8},\\ \overline{p}_{-q}(8n+4) &\equiv 0 \pmod{2},\\ \overline{p}_{-q}(8n+5) &\equiv 0 \pmod{8},\\ \overline{p}_{-q}(8n+6) &\equiv 0 \pmod{8},\\ \overline{p}_{-q}(8n+7) &\equiv 0 \pmod{32}. \end{aligned}

The conjecture generalizes the proved congruences for q=5,7,11,q=5,7,11, and 1313 established earlier in the paper, and predicts further congruences for all prime numbers of colors. Its general case remains open in the supplied source.

References
  1. Manjil P. Saikia, “Some Missed Congruences modulo powers of 2 for t-colored overpartitions”, arXiv:2301.09846 (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.