Parity bias conjecture for missing integers in overpartitions

From papers

Let P(n,m)\overline{P}(n,m) denote the number of overpartitions of nn with mm missing integers. Define Me(n)\overline{\mathcal{M}}_e(n) and Mo(n)\overline{\mathcal{M}}_o(n) to be the numbers of overpartitions of nn with an even and odd number of missing integers, respectively. Overpartition parity bias conjecture. For any positive integer n>27n>27,

Me(n)>Mo(n).\overline{\mathcal{M}}_e(n)>\overline{\mathcal{M}}_o(n).

Thus the conjecture asserts that, beyond 2727, overpartitions with an even number of missing integers outnumber those with an odd number. The source motivates this from the apparent positivity of the associated sequence and gives no proof or resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Subhash Chand Bhoria, Pramod Eyyunni and Subhrangsu Santra, “On the number of missing integers in partitions”, arXiv:2604.12557 (2026).

Solutions 0

No solutions have been posted yet.