

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.
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.
Related content


Euler’s Exponential Formula for Semigroups
Semigroup Forum, Vol. 68, Iss. 1, 2004-01 ,pp. :




Refinements of Vaught's normal from theorem
The Journal of Symbolic Logic, Vol. 44, Iss. 3, 1979-09 ,pp. :




Beyond the Basel problem: Euler’s derivation of the general formula for ζ (2
The Mathematical Gazette, Vol. 98, Iss. 543, 2014-11 ,pp. :