Restricted k-color partitions
Author:
- William J. KeithWKWilliam J. Keith
Preprint
Abstract
We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems: generating function dissections, modular forms, bijections, and other combinatorial maps. We find connections to divisor sums, the Han/Nekrasov-Okounkov hook length formula and a possible approach to a finitization, and other topics, suggesting that a rich mine of results is available.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Arithmetic properties of Andrews' singular overpartitionsInternational Journal of Number Theory, 2015
- Ramanujan-type congruences for overpartitions modulo 16The Ramanujan Journal, 2015
- Ramanujan-type congruences for overpartitions modulo 5Journal of Number Theory, 2015
- New Ramanujan-like congruences modulo powers of 2 and 3 for overpartitionsJournal of Number Theory, 2013
- Analogues of Ramanujan’s partition identitiesThe Ramanujan Journal, 2012
- A short note on the overpartition functionDiscrete Mathematics, 2009
- Dyson's Rank, Overpartitions, and Weak Maass FormsInternational Mathematics Research Notices, 2007
- Stacked lattice boxesAnnals of Combinatorics, 1999
- Construction and Application of a Class of Modular Functions (II)†Proceedings of the London Mathematical Society, 1959