A Bijection for Partitions with Initial Repetitions
Combinatorics
2010-10-14 v1
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.
Cite
@article{arxiv.1010.2653,
title = {A Bijection for Partitions with Initial Repetitions},
author = {William J. Keith},
journal= {arXiv preprint arXiv:1010.2653},
year = {2010}
}
Comments
5 pages