English

$M_2$-Ranks of overpartitions modulo $6$ and $10$

Combinatorics 2018-05-11 v1

Abstract

In this paper, we obtain inequalities on M2M_2-ranks of overpartitions modulo 66. Let N2(s,m,n)\overline{N}_2(s,m,n) to be the number of overpartitions of nn whose M2M_2-rank is congruent to ss modulo mm. For M2M_2-ranks modulo 33, Lovejoy and Osburn derived the generating function of N2(s,3,n)N2(t,3,n)\overline{N}_2(s,3,n)-\overline{N}_2(t,3,n), which implies the inequalities N2(0,3,n)N2(1,3,n)\overline{N}_2(0,3,n)\geq\overline{N}_2(1,3,n). For =6,10\ell=6, 10, we consider the generating function Rs,t(d,)\overline{R}_{s,t}(d,\ell) of the M2M_2-rank differences N2(s,,n/2+d)+N2(s+1,,n/2+d)N2(t,,n/2+d)N2(t+1,,n/2+d)\overline{N}_2(s,\ell,\ell n/2+d) + \overline{N}_2(s+1,\ell,\ell n/2+d) - \overline{N}_2(t,\ell,\ell n/2+d) - \overline{N}_2(t+1,\ell,\ell n/2+d). By the method of Lovejoy and Osburn, we derive a formula for R0,2(d,6)\overline{R}_{0,2}(d,6). This leads to the inequalities for n0n\geq0, N2(0,6,3n)N2(2,6,3n)\overline{N}_2(0,6,3n)\geq\overline{N}_2(2,6,3n) and N2(0,6,3n+1)N2(2,6,3n+1)\overline{N}_2(0,6,3n+1) \geq \overline{N}_2(2,6,3n+1). Based on the valence formula for modular functions, we compute R0,4(d,10)\overline{R}_{0,4}(d,10) and R1,3(d,10)\overline{R}_{1,3}(d,10). In particular, we notice that the generating function R0,2(2,6)\overline{R}_{0,2}(2,6) can be expressed in terms of the third order mock theta function ρ(q)\rho(q), and the generating functions R0,4(4,10)\overline{R}_{0,4}(4,10), R1,3(1,10)\overline{R}_{1,3}(1,10) and R1,3(4,10)\overline{R}_{1,3}(4,10) can also be expressed in terms of the tenth order mock theta functions ϕ(q)\phi(q) and ψ(q)\psi(q).

Keywords

Cite

@article{arxiv.1805.03780,
  title  = {$M_2$-Ranks of overpartitions modulo $6$ and $10$},
  author = {Helen W. J. Zhang},
  journal= {arXiv preprint arXiv:1805.03780},
  year   = {2018}
}