A Unification of Two Refinements of Euler's Partition Theorem

Details A Unification of Two Refinements of Euler's Partition Theorem A Unification of Two Refinements of Euler's Partition Theorem

2008-12-15

arxiv.org/abs/0812.2826v3

Mathematics

Combinatorics

14 pages, 3 figures, the last version, to appear in The Ramanujan Journal

Scientific paper

We obtain a unification of two refinements of Euler's partition theorem
respectively due to Bessenrodt and Glaisher. A specialization of Bessenrodt's
insertion algorithm for a generalization of the Andrews-Olsson partition
identity is used in our combinatorial construction.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-349400