2000 character limit reached
Restricted k-color partitions, II
Published 23 Jan 2020 in math.CO | (2001.08351v1)
Abstract: We consider $(k,j)$-colored partitions, partitions in which $k$ colors exist but at most $j$ colors may be chosen per size of part. In particular these generalize overpartitions. Advancing previous work, we find new congruences, including in previously unexplored cases where $k$ and $j$ are not coprime, as well as some noncongruences. As a useful aside, we give the apparently new generating function for the number of partitions in the $N \times M$ box with a given number of part sizes, and extend to multiple colors a conjecture of Dousse and Kim on unimodality in overpartitions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.