A Unification of Two Refinements of Euler's Partition Theorem
Combinatorics
2009-02-25 v3 Number Theory
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.
Keywords
Cite
@article{arxiv.0812.2826,
title = {A Unification of Two Refinements of Euler's Partition Theorem},
author = {William Y. C. Chen and Henry Y. Gao and Kathy Q. Ji and Martin Y. X. Li},
journal= {arXiv preprint arXiv:0812.2826},
year = {2009}
}
Comments
14 pages, 3 figures, the last version, to appear in The Ramanujan Journal