A Bijection for Partitions with Initial Repetitions
classification
🧮 math.CO
keywords
partitionstheoremtimesandrewsappearsarisebijectionbijectively
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.