Related papers: Dyson's crank and unimodal compositions
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…
The partition crank is a statistic on partitions introduced by Freeman Dyson to explain Ramanujan's congruences. In this paper, we prove that the crank is asymptotically equidistributed modulo Q, for any odd number Q. To prove this, we…
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 utilize Dyson's concept of the adjoint of a partition to derive an infinite family of new polynomial analogues of Euler's Pentagonal Number Theorem. We streamline Dyson's bijection relating partitions with crank <= k and those with k in…
In 1919, Ramanujan discovered his famous congruences for the partition function. Not too long after, Freeman Dyson conjectured a combinatorial statistic existed that explained the three congruences, which he dubbed the \textit{crank}. A…
In $1944$, Freeman Dyson defined the concept of rank of an integer partition and introduced without definition the term of crank of an integer partition. A definition for the crank satisfying the properties hypothesized for it by Dyson was…
Mahlburg (2005) brilliantly showed the importance of crank functions in partition congruences that were originally guessed by Dyson (1944). Ramanujan's partition functions are the centre of these works. Not only for the theory on cranks,…
A partition statistic ` crank' gives combinatorial interpretations for Ramanujan's famous partition congruences. In this paper, we establish an asymptotic formula, Ramanujan type congruences, and q-series identities that the number of…
Andrews and Newman have recently introduced the notion of the mex of a partition, the smallest positive integer that is not a part. The concept has been used since at least 2011, though, with connections to Frobenius symbols. Recently the…
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…
Several authors have recently considered the smallest positive part missing from an integer partition, known as the minimum excludant or mex. In this work, we revisit and extend connections between Dyson's crank statistics, the mex, and…
In this paper, we investigate the arithmetic properties of the difference between the number of partitions of a positive integer $n$ with even crank and those with odd crank, denoted $C(n)=c_e(n)-c_o(n)$. Inspired by Ramanujan's classical…
Recently, much attention has been given to various inequalities among partition functions. For example, Nicolas, {and later DeSavlvo--Pak,} proved that $p(n)$ is eventually log-concave, and Ji--Zang showed that the cranks are eventually…
Let $R(z,q)$ be the two-variable generating function of Dyson's rank function. In a recent joint work with Frank Garvan, we investigated the transformation of the elements of the $p$-dissection of $R(\zeta_p,q)$, where $\zeta_p$ is a…
New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.
The main objective of this paper is to investigate the distribution of the Andrews-Garvan-Dyson crank of a partition. Let $M(m,n)$ denote the number of partitions of $n$ with the Andrews-Garvan-Dyson crank $m$, we show that the sequence…
In this paper we refine a weighted partition identity of Alladi. We write explicit formulas of generating functions for the number of partitions grouped with respect to a partition statistic other than the norm. We tie our weighted results…
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…
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…
Ramanujan's congruence $p(5k+4) \equiv 0 \pmod 5$ led Dyson \cite{dyson} to conjecture the existence of a measure "rank" such that $p(5k+4)$ partitions of $5k+4$ could be divided into sub-classes with equal cardinality to give a direct…