A theta-block crank conjecture for -colored partitions
A theta-block crank conjecture for -colored partitions
Let be positive odd integers. Let and be the variables in the generating function, let denote the crank variables, and let denote the corresponding root-of-unity parameter. Choose to be consecutive even integers and to be consecutive odd integers. Define
The theta-block crank conjecture. The function defines a crank for the desired -colored partitions and explains most of the Ramanujan-like congruences satisfied by their partition numbers. The author suggests that theta-block theory may establish this general crank construction, analogously to prior work on crank generating functions. The statement is not accompanied by a resolution, and the paper does not specify precisely which congruences are covered by “most.”
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Samuel Wilson, “A proposed crank for (k+j)-colored partitions, with j colors having distinct parts”, arXiv:2407.07891 (2024).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.