%0 Journal Article
%T A Bijection for Partitions with Initial Repetitions
%A William J. Keith
%J Mathematics
%D 2010
%I arXiv
%X 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.
%U http://arxiv.org/abs/1010.2653v1