William Y. C. Chen, Henry Y. Gao, Kathy Q. Ji, Martin Y. X. Li
Published 2008-12-15, updated 2009-02-25Version 3
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.
Comments: 14 pages, 3 figures, the last version, to appear in The Ramanujan Journal
Euler's Partition Theorem with Upper Bounds on Multiplicities
Generalizing a partition theorem of Andrews
Combinatorial proofs and generalizations on conjectures related with Euler's partition theorem
![QR code for arXiv:0812.2826 [math.CO]](http://oss.arxitics.com/images/favicon.svg)