Related papers: Deviation of the rank and crank modulo 11

At the 1987 Ramanujan Centenary meeting Dyson asked for a coherent group-theoretical structure for Ramanujan's mock theta functions analogous to Hecke's theory of modular forms. Many of Ramanujan's mock theta functions can be written in…

In this paper, we refine a result of Andrews and Merca on truncated pentagonal number series. Subsequently, we establish some positivity results involving Andrews--Gordon--Bressoud identities and $d$-regular partitions. In particular, we…

In this article, we refine a result of Andrews and Newman, that is, the sum of minimal excludants over all the partitions of a number $n$ equals the number of partitions of $n$ into distinct parts with two colors. As a consequence, we find…

In 2012, Andrews and Merca obtained a truncated version of Euler's pentagonal number theorem and showed the nonnegativity related to partition functions. Meanwhile, Andrews-Merca and Guo-Zeng independently conjectured that the truncated…

Based on work of Atkin and Swinnerton-Dyer on partition rank difference functions, and more recent work of Lovejoy and Osburn, Mao has proved several inequalities between partition ranks modulo $10$, and additional results modulo $6$ and…

Andrews, Chan, and Kim recently introduced a modified definition of crank and rank moments for integer partitions that allows the study of both even and odd moments. In this paper, we prove the asymptotic behavior of these moments in all…

Congruences are found modulo powers of 5, 7 and 13 for Andrews' smallest parts partition function spt(n). These congruences are reminiscent of Ramanujan's partition congruences modulo powers of 5, 7 and 11. Recently, Ono proved explicit…

The crank-mex theorem states that the number of integer partitions of $n$ with nonnegative crank equals the number with odd minimal excludant (mex). Andrews and M. Newman recently refined that result in terms of the number of parts greater…

We give combinatorial interpretations of two residual cranks of overpartitions defined by Bringmann, Lovejoy and Osburn in 2009 analogous to the crank of partitions given by Andrews and the first author in 1988. As a consequence, we give…

We obtain a finite analogue of a recent generalization of an identity in Ramanujan's Notebooks. Differentiating it with respect to one of the parameters leads to a result whose limiting case gives a finite analogue of Andrews' famous…

In 1944 Dyson defined the rank of a partition as the largest part minus the number of parts, and conjectured that the residue of the rank mod 5 divides the partitions of 5n+4 into five equal classes. This gave a combinatorial explanation of…

In this paper, the generating functions of Garvans so-called $k$-ranks are used, to define a family of mock Eisenstein series. The $k$-rank moments are then expressed as partition traces of these functions. We explore the modular properties…

We prove general fomulas for the deviations of two overpartition ranks from the average. These formulas are in terms of Appell--Lerch series and sums of quotients of theta functions and can be used, among other things, to recover any of the…

In this paper we find the smallest part function related to the $4$-th symmetrized crank function, corresponding to the one obtained in Patkowski [11] for the $4$-th symmetrized rank function. This provides us with a direct relationship…

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…

In a recent study of sign-balanced, labelled posets Stanley [13], introduced a new integral partition statistic srank(pi) = O(pi) - O(pi'), where O(pi) denotes the number of odd parts of the partition pi and pi' the conjugate of pi. In [1]…

In his deathbed letter to Hardy, Ramanujan gave a vague definition of a mock modular function: at each root of unity its asymptotics matches the one of a modular form, though a choice of the modular function depends on the root of unity.…

Let $N(\leq m,n)$ denote the number of partitions of $n$ with rank not greater than $m$, and let $M(\leq m,n)$ denote the number of partitions of $n$ with crank not greater than $m$. Bringmann and Mahlburg observed that $N(\leq m,n)\leq…

We show that the shifted rank, or srank, of any partition $\lambda$ with distinct parts equals the lowest degree of the terms appearing in the expansion of Schur's $Q_{\lambda}$ function in terms of power sum symmetric functions. This gives…

In a recent paper, Andrews, Dixit, and Yee introduced a new spt-type function $\operatorname{spt}_\omega(n)$, which is closely related to Ramanujan's third order mock theta function $\omega(q)$. Garvan and Jennings-Shaffer introduce a crank…