arXiv Analytics

Sign in

arXiv:2407.07891 [math.CO]AbstractReferencesReviewsResources

A proposed crank for $(k+j)$-colored partitions, with $j$ colors having distinct parts

Samuel Wilson

Published 2024-07-10Version 1

In 1988, George Andrews and Frank Garvan discovered a crank for $p(n)$. In 2020, Larry Rolen, Zack Tripp, and Ian Wagner generalized the crank for p(n) in order to accommodate Ramanujan-like congruences for $k$-colored partitions. In this paper, we utilize the techniques used by Rolen, Tripp, and Wagner for crank generating functions in order to define a crank generating function for $(k + j)$-colored partitions where $j$ colors have distinct parts. We provide three infinite families of crank generating functions and conjecture a general crank generating function for such partitions.

Comments: 6 pages, 1 table
Categories: math.CO, math.NT
Subjects: 05A15, 05A17
Related articles: Most relevant | Search more
arXiv:1702.05634 [math.CO] (Published 2017-02-18)
Explicit expressions for the moments of the size of an (n, dn-1)-core partition with distinct parts
arXiv:1611.05775 [math.CO] (Published 2016-11-17)
Explicit (Polynomial!) Expressions for the Expectation, Variance and Higher Moments of the Size of a (2n + 1, 2n + 3)-core partition with Distinct Parts
arXiv:1804.09091 [math.CO] (Published 2018-04-24)
On the Polynomiality of moments of sizes for random $(n, dn\pm 1)$-core partitions with distinct parts