We prove formulas for generalized rank deviations for overpartitions. These formulas are in terms of Appell-Lerch series and sums of quotients of theta functions and extend work of Lovejoy and the second author. As an application, we compute a dissection.
In 1954, Atkin and Swinnerton-Dyer proved Dyson's conjectures on the rank of a partition by establishing formulas for the generating functions for rank differences in arithmetic progressions. In this paper, we prove formulas for the generating functions for rank differences for overpartitions. These are in terms of modular functions and generalized Lambert series.
In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. These moments satisfy a strict inequality. We prove that a strict inequality also holds for the first rank and crank moments of overpartitions and consider a new combinatorial interpretation in this setting.
Let $\overline{N}_2(a,c,n)$ be the number of overpartitions of $n$ whose the $M_2$-rank is congruent to $a$ modulo $c$. In this paper, we obtain the asymptotic formula of $\overline{N}_2(a,c,n)$ utilizing the Ingham Tauberian Theorem. As applications, we derive inequalities concerning with $\overline{N}_2(a,c,n)$ including its strict concavity and log-concavity.
This is the third and final installment in our series of papers applying the method of Atkin and Swinnerton-Dyer to deduce formulas for rank differences. The study of rank differences was initiated by Atkin and Swinnerton-Dyer in their proof of Dyson's conjectures concerning Ramanujan's congruences for the partition function. Since then, other types of rank differences for statistics associated to partitions have been investigated. In this paper, we prove explicit formulas for M_2-rank differences for overpartitions. Additionally, we express a third order mock theta function in terms of rank d…
In this paper we obtain asymptotic formulas for the positive crank and rank moments for overpartitions. Moreover, we show that crank and rank moments are asymptotically equal while the difference is asymptotically positive. This indicates that there exist analogous higher ospt-functions for overpartitions, which we define.
We study two types of crank moments and two types of rank moments for overpartitions. We show that the crank moments and their derivatives, along with certain linear combinations of the rank moments and their derivatives, can be written in terms of quasimodular forms. We then use this fact to prove exact relations involving the moments as well as congruence properties modulo 3, 5, and 7 for some combinatorial functions which may be expressed in terms of the second moments. Finally, we establish a congruence modulo 3 involving one such combinatorial function and the Hurwitz class number H(n).
We show that the Zagier-Eisenstein series shares its non-holomorphic part with certain weak Maass forms whose holomorphic parts are generating functions for overpartition rank differences. This has a number of consequences, including exact formulas, asymptotics, and congruences for the rank differences as well as $q$-series identities of the mock theta type.
We investigate the modular properties of a new partition rank, the $M_d$-rank of overpartitions. In fact this is an infinite family of ranks, indexed by the positive integer $d$, that gives both the Dyson rank of overpartitions and the overpartition $M_2$-rank as special cases. The $M_d$-rank of overpartitions is the holomorphic part of a certain harmonic Maass form of weight $\frac{1}{2}$. We give the exact transformation of this harmonic Maass form along with a few identities for the $M_d$-rank.
Using that the overpartition rank function is the holomorphic part of a harmonic Maass form, we deduce formulas for the rank differences modulo 7. To do so we make improvements on the current state of the overpartition rank function in terms of harmonic Maass forms by giving simple formulas for the transformations under $\mbox{SL}_2(\mathbb{Z})$ as well as formulas for orders at cusps.
In this paper we compute asymptotics for the coefficients of an infinite class of overpartition rank generating functions. Using these results, we show that $ \overline{N}(a,c,n), $ the number of overpartitions of $ n $ with rank congruent to $ a $ modulo $ c, $ is equidistributed with respect to $ 0\le a< c, $ for any $ c\ge2, $ as $ n\to\infty $ and, in addition, we prove some inequalities between ranks of overpartitions conjectured by Ji, Zhang and Zhao (2018), and Wei and Zhang (2018) for $ n=6 $ and $ n=10. $
Bringmann and Lovejoy introduced a rank for overpartition pairs and investigated its role in congruence properties of $\bar{pp}(n)$, the number of overpartition pairs of n. In particular, they applied the theory of Klein forms to show that there exist many Ramanujan-type congruences for the number $\bar{pp}(n)$. In this paper, we shall derive two Ramanujan-type identities and some explicit congruences for $\bar{pp}(n)$. Moreover, we find three ranks as combinatorial interpretations of the fact that $\bar{pp}(n)$ is divisible by three for any n. We also construct infinite families of congruence…
We generalize the generating series of the Dyson ranks and $M_2$-ranks of overpartitions to obtain $k$-fold variants, and give a combinatorial interpretation of each. The $k$-fold generating series correspond to the full ranks of two families of buffered Frobenius representations, which generalize Lovejoy's first and second Frobenius representations of overpartitions, respectively.
In a series of papers the first author and Ono connected the rank, a partition statistic introduced by Dyson, to weak Maass forms, a new class of functions which are related to modular forms. Naturally it is of wide interest to find other explicit examples of Maass forms. Here we construct a new infinite family of such forms, arising from overpartitions. As applications we obtain combinatorial decompositions of Ramanujan-type congruences for overpartitions as well as the modularity of rank differences in certain arithmetic progressions.
We consider the symmetrized moments of three ranks and cranks, similar to the work of Garvan for the rank and crank of a partition. By using Bailey pairs and elementary rearrangements, we are able to find useful expressions for these moments. We then deduce inequalities between the corresponding ordinary moments. In particular we prove that the crank moment for overpartitions is always larger than the rank moment for overpartitions; with recent asymptotics this was known to hold for sufficiently large values of n for each fixed k. Lastly we provide higher order spt functions for overpartitions…
By considering the $M_2$-rank of an overpartition as well as a residual crank, we give another combinatorial refinement of the congruences $\overline{\mbox{spt}}_2(3n)\equiv \overline{\mbox{spt}}_2(3n+1)\equiv 0\pmod{3}$. Here $\overline{\mbox{spt}}_2(n)$ is the total number of occurrences of the smallest parts among the overpartitions of $n$ where the smallest part is even and not overlined. Our proof depends on Bailey's Lemma and the rank difference formulas of Lovejoy and Osburn for the $M_2$-rank of an overpartition. This congruence, along with a modulo $5$ congruence, has previously been …
We prove that the generating function of overpartition $M2$-rank differences is, up to coefficient signs, a component of the vector-valued mock Eisenstein series attached to a certain quadratic form. We use this to compute analogs of the class number relations for $M2$-rank differences. As applications we split the Kronecker-Hurwitz relation into its "even" and "odd" parts and calculate sums over Hurwitz class numbers of the form $\sum_{r \in \mathbb{Z}} H(n - 2r^2)$.
In this paper we give a full description of the inequalities that can occur between overpartition ranks. If $ \overline{N}(a,c,n) $ denotes the number of overpartitions of $ n $ with rank congruent to $ a $ modulo $ c,$ we prove that for any $ c\ge7 $ and $ 0\le a<b\le\left\lfloor\frac{c}{2}\right\rfloor $ we have $ \overline{N}(a,c,n)>\overline{N}(b,c,n) $ for $n$ large enough. That the sign of the rank differences $ \overline{N}(a,c,n)-\overline{N}(b,c,n) $ depends on the residue class of $ n $ modulo $ c $ in the case of small moduli, such as $ c=6, $ is known due to the work of Ji, Zhang a…
Recently, Andrews, Chan, Kim and Osburn introduced a $q$-series $h(q)$ for the study of the first positive rank and crank moments for overpartitions. They conjectured that for all integers $m \geq 3$, \begin{equation*}\label{hqcon} \frac{1}{(q)_{\infty}} (h(q) - m h(q^{m})) \end{equation*} has positive power series coefficients for all powers of $q$. Byungchan Kim, Eunmi Kim and Jeehyeon Seo provided a combinatorial interpretation and proved it is asymptotically true by circle method. In this note, we show this conjecture is true if $m$ is any positive power of $2$, and we show that in order t…
Bringmann, Lovejoy, and Osburn showed that the generating functions of the spt-overpartition functions spt(n), spt1(n), spt2(n), and M2spt(n) are quasimock theta functions, and satisfy a number of simple Ramanujan-like congruences. Andrews, Garvan, and Liang defined an spt-crank in terms of weighted vector partitions which combinatorially explain simple congruences mod 5 and 7 for spt (n). Chen, Ji, and Zang were able to define this spt-crank in terms of ordinary partitions. In this paper we define spt-cranks in terms of vector partitions that combinatorially explain the known simple congruenc…
Denote by $p(n)$ the number of partitions of $n$ and by $N(a,M;n)$ the number of partitions of $n$ with rank congruent to $a$ modulo $M$. By considering the deviation \begin{equation*} D(a,M) := \sum_{n= 0}^{\infty}\left(N(a,M;n) - \frac{p(n)}{M}\right) q^n, \end{equation*} we give new proofs of recent results of Andrews, Berndt, Chan, Kim and Malik on mock theta functions and ranks of partitions. By considering deviations of cranks, we give new proofs of Lewis and Santa-Gadea's rank-crank identities. We revisit ranks and cranks modulus $M=5$ and $7$, with our results on cranks appearing to be…
Denote by $p(n)$ the number of partitions of $n$ and by $N(a,M;n)$ the number of partitions of $n$ with rank congruent to $a$ modulo $M$. We find and prove a general formula for Dyson's ranks by considering the deviation of the ranks from the average: \begin{equation*} D(a,M) := \sum_{n= 0}^{\infty}\left(N(a,M;n) - \frac{p(n)}{M}\right) q^n. \end{equation*} Using Appell--Lerch sum properties we decompose $D(a,M)$ into modular and mock modular parts so that the mock modular component is supported on certain arithmetic progressions, whose modulus we can control. Using our decomposition, we show …
