A bijection for partitions with initial repetitions

作者：Keith William J^*

来源：Ramanujan Journal, 2012, 27(2): 163-167.

DOI：10.1007/s11139-011-9298-x

• Partitions
• Initial
• k-repetitions

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.

• 出版日期2012-2