The 'crank' is a partition statistic which originally arose to give combinatorial interpretations for Ramanujan's famous partition congruences. In this paper, we establish an asymptotic formula and a family of Ramanujan type congruences satisfied by the number of partitions of n with even crank Me (n) minus the number of partitions of n with odd crank Mo (n). We also discuss the combinatorial implications of q-series identities involving Me (n) - Mo (n). Finally, we determine the exact values of Me (n) - Mo (n) in the case of partitions into distinct parts. These values are at most two, and zero for infinitely many n.
|Number of pages||13|
|Journal||Journal of Combinatorial Theory. Series A|
|Publication status||Published - 2009 Jul|
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics