Related papers: Rank and Crank Moments for Partitions without Repe…
Bringmann, Mahlburg, and Rhoades have found asymptotic expressions for all moments of the partition statistics rank and crank. In this work we extend their methods to higher ranks. The $T$-rank, introduced by Garvan, for odd integers T=3 is…
In this paper, we establish that the number of partitions of a natural number with positive odd rank is equal to the number of two-color partitions (red and blue), where the smallest part is even (say $2n$) and all red parts are even and…
Moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves a conjecture due to…
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…
Recently, Amdeberhan and Merca proved some arithmetic properties of the crank parity function $C(n)$ defined as the difference between the number of partitions of $n$ with even cranks and those with odd cranks and the sequence $a(n)$ whose…
Recently the author introduced two new integer partition quadruple functions, which satisfy Ramanujan-type congruences modulo $3$, $5$, $7$, and $13$. Here we reprove the congruences modulo $3$, $5$, and $7$ by defining a rank-type…
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…
In this paper, we discuss a few recent conjectures made by George Beck related to the ranks and cranks of partitions. The conjectures for the rank of a partition were proved by Andrews by using results due to Atkin and Swinnerton-Dyer on a…
Andrews, Lewis and Lovejoy introduced the partition function $PD(n)$ as the number of partitions of $n$ with designated summands. A bipartition of $n$ is an ordered pair of partitions $(\pi_1, \pi_2)$ with the sum of all of the parts being…
Ramanujan famously found congruences for the partition function like p(5n+4) = 0 modulo 5. We provide a method to find all simple congruences of this type in the coefficients of the inverse of a modular form on Gamma_{1}(4) which is…
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…
It is proved that the number of partitions of n with odd mex and k parts that aren't ones equals the number of partitions of n with nonnegative crank and k parts that aren't ones..
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…
Atkin and Garvan introduced the functions $N_k(n)$ and $M_k(n)$, which denote the $k$-th moments of ranks and cranks in the theory of partitions. Let $e_{2r}(n)$ be the $n$-th Fourier coefficient of $E_{2r}(\tau)/\eta(\tau)$, where…
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,…
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 this paper, motivated by the work of Mahlburg, we find congruences for a large class of modular forms. Moreover, we generalize the generating function of the Andrews-Garvan-Dyson crank on partition and establish several new infinite…
In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…
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…
Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.