A bijection for partitions with initial repetitions
- 114 Downloads
A theorem of Andrews equates partitions in which no part is repeated more than 2k−1 times to partitions in which, if j appears at least k times, all parts less than j also do so. This paper proves the theorem bijectively, with some of the generalizations that usually arise from such proofs.
KeywordsPartitions Initial k-repetitions
Mathematics Subject Classification (2000)05A17 11P81
Unable to display preview. Download preview PDF.
- 4.Keith, W.: Ranks of Partitions and Durfee Symbols. Ph.D. Thesis, Pennsylvania State University (June 2007). URL: http://etda.libraries.psu.edu/theses/approved/WorldWideIndex/ETD-2026/index.html