A Unification of Two Refinements of Euler's Partition Theorem

Abstract

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.

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