Euler's Partition Theorem with Upper Bounds on Multiplicities

Details Euler's Partition Theorem with Upper Bounds on Multiplicities Euler's Partition Theorem with Upper Bounds on Multiplicities

2011-11-07

arxiv.org/abs/1111.1489v1

Mathematics

Combinatorics

14 pages

Scientific paper

We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m. The first proof relies on two formulas with two parameters that are related to the four-parameter formulas of Boulet. We also give a combinatorial proof of this result by using Sylvester's bijection, which implies a stronger partition theorem. For m=0, our result reduces to Bessenrodt's refinement of Euler's Theorem. If the alternating sum and the number of odd parts are not taken into account, we are led to a connection to a generalization of Euler's theorem, which can be deduced from a theorem of Andrews' on equivalent upper bound sequences of multiplicities. Analogously, we show that the number of partitions of n with alternating sum k such that the multiplicity of each even part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is also bounded by 2m+1.

Affiliated with

Also associated with

No associations

Rating

Euler's Partition Theorem with Upper Bounds on Multiplicities 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 Euler's Partition Theorem with Upper Bounds on Multiplicities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Euler's Partition Theorem with Upper Bounds on Multiplicities will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-689738