Related papers: M_2-rank differences for overpartitions

Multiranks and new rank/crank analogs for a variety of partitions are given, so as to imply combinatorially some arithmetic properties enjoyed by these types of partitions. Our methods are elementary relying entirely on the three classical…

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…

We obtain two-variable Hecke-Rogers identities for three universal mock theta functions. This implies that many of Ramanujan's mock theta functions, including all the third order functions, have a Hecke-Rogers-type double sum…

Dyson famously provided combinatorial explanations for Ramanujan's partition congruences modulo $5$ and $7$ via his rank function, and postulated that an invariant explaining all of Ramanujan's congruences modulo $5$, $7$, and $11$ should…

Successive ranks of a partition, which were introduced by Atkin, are the difference of the $i$th row and the $i$th column in the Ferrers graph. Recently, in the study of singular overpartitions, Andrews revisited successive ranks and parity…

Dyson's rank function and the Andrews--Garvan crank function famously give combinatorial witnesses for Ramanujan's partition function congruences modulo 5, 7, and 11. While these functions can be used to show that the corresponding sets of…

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…

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…

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…

The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…

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…

In this paper, we obtain infinitely many non-trivial identities and inequalities between full rank differences for 2-marked Durfee symbols, a generalization of partitions introduced by Andrews. A certain strict inequality, which almost…

Partitions associated with mock theta functions have received a great deal of attention in the literature. Recently, Choi and Kim derived several partition identities from the third and sixth order mock theta functions. In addition, three…

We study the generating function of the excess number of Rogers-Ramanujan partitions with odd rank over those with even rank, and, using combinatorial and analytical techniques, show that this generating function is closely connected with…

In a very recent work, G. E. Andrews defined the combinatorial objects which he called {\it singular overpartitions} with the goal of presenting a general theorem for overpartitions which is analogous to theorems of Rogers--Ramanujan type…

Using quasimodular forms with respect to $\Gamma_0(4)$ we find exact relations between the M2-rank for partitions without repeated odd parts and three residual cranks. From these identities we are able to deduce various congruences mod 3…

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…

It is well known that Ramanujan conjectured congruences modulo powers of 5, 7 and and 11 for the partition function. These were subsequently proved by Watson (1938) and Atkin (1967). In 2009 Choi, Kang, and Lovejoy proved congruences modulo…

Let spt(n) denote the total number of appearances of smallest parts in the partitions of n. Recently, Andrews showed how spt(n) is related to the second rank moment, and proved some surprising Ramanujan-type congruences mod 5, 7 and 13. We…

For a given partition of (1, 2, ..., 2n) into two disjoint subsets A and B with n elements in each, consider the maximum number of times any integer occurs as the difference between an element of A and an element of B. The minimum value of…