The BG-rank of a partition and its applications

Abstract

Let π be a partition. In [2] we defined BG-rank(π) as an alternating sum of parities of parts. This statistic was employed to generalize and refine the famous Ramanujan modulo 5 partition congruence. Let pj(n)(at,j(n)) denote a number of partitions (t-cores) of n with BG-rank=j. Here, we provide an elegant combinatorial proof that 5|pj(5n+4) by showing that the residue of the 5-core crank mod 5 divides the partitions enumerated by pj(5n+4) into five equal classes. This proof uses the orbit construction in [2] and new identity for BG-rank. In addition, we find eta-quotient representation for the generating functions for coefficients at,floor((t+1)/4)(n), at,-floor((t-1)/4)(n) when t is an odd, positive integer. Finally, we derive explicit formulas for the coefficients a5,j(n) with j=0,1,-1.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…