Wei–Zhang inequalities for overpartition ranks modulo 6

About 7 years old · traced to

Let N‾(a,c,n)\overline N(a,c,n) denote the number of overpartitions of nn whose rank is congruent to aa modulo cc.

Wei–Zhang inequalities. For n≥11n\geq 11,

N‾(0,6,3n)≥N‾(1,6,3n)=N‾(3,6,3n)≥N‾(2,6,3n),\overline N(0,6,3n)\geq \overline N(1,6,3n)=\overline N(3,6,3n)\geq \overline N(2,6,3n), N‾(0,6,3n+1)≥N‾(1,6,3n+1)=N‾(3,6,3n+1)≥N‾(2,6,3n+1),\overline N(0,6,3n+1)\geq \overline N(1,6,3n+1)=\overline N(3,6,3n+1)\geq \overline N(2,6,3n+1),

and

N‾(1,6,3n+2)≥N‾(2,6,3n+2)≥N‾(0,6,3n+2)≥N‾(3,6,3n+2).\overline N(1,6,3n+2)\geq \overline N(2,6,3n+2)\geq \overline N(0,6,3n+2)\geq \overline N(3,6,3n+2).

These are inequalities among overpartition rank classes in residue classes modulo 66. The supplied text attributes them to Wei and Zhang and gives no resolution evidence, so their general status is left open.

References

Primary source

Alexandru Ciolan, “Ranks of overpartitions: Asymptotics and inequalities”, arXiv:1904.07055 (2019).

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.