2010/10/13 by William J. Keith, Keith, William J.
Mathematics · #05A19 #11P81 #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Analytic Number Theory Research #Combinatorics (math.CO) #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1010.2653
openalex publication_date 2010/10/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.