A unification of two refinements of Euler’s partition theorem

Author: Chen William   Gao Henry   Ji Kathy   Li Martin  

Publisher: Springer Publishing Company

ISSN: 1382-4090

Source: The Ramanujan Journal, Vol.23, Iss.1-3, 2010-12, pp. : 137-149

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

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.