A Bijection for Partitions with Initial Repetitions

Details A Bijection for Partitions with Initial Repetitions A Bijection for Partitions with Initial Repetitions

2010-10-13

arxiv.org/abs/1010.2653v1

Mathematics

Combinatorics

5 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Bijection for Partitions with Initial Repetitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Bijection for Partitions with Initial Repetitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Bijection for Partitions with Initial Repetitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-226722