Some identities on Lin-Peng-Toh's partition statistic of k-colored partitions
Abstract
Recently, Andrews proved two conjectures on a partition statistic introduced by Beck. Very recently, Chern established some results on weighted rank and crank moments and proved many Andrews-Beck type congruences. Motivated by Andrews and Chern's work, Lin, Peng and To introduced a partition statistic of k-colored partitions NBk(r,m,n) which counts the total number of parts of π(1) in each k-colored partition π of n with crankk(π) congruent to r modulo m and proved a number of congruences for NBk(r,m,n). In this paper, we prove some identities on NBk(r,m,n) which are analogous to Ramanujan's ``most beautiful identity". Moreover, those identities imply some congruences proved by Lin, Peng and Toh.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.