A Unification of Two Refinements of Euler's Partition Theorem
Preprint
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
All Related Versions
This publication has 13 references indexed in Scilit:
- A four-parameter partition identityThe Ramanujan Journal, 2006
- The q-Variations of Sylvester’s Bijection Between Odd and Strict PartitionsThe Ramanujan Journal, 2005
- On Fine’s Partition Theorems, Dyson, Andrews, And Missed OpportunitiesThe Mathematical Intelligencer, 2003
- A combinatorial proof of Andrews’ partition functions related to Schur’s partition theoremProceedings of the American Mathematical Society, 2002
- A Note on Partitions into Distinct Parts and Odd PartsThe Ramanujan Journal, 1999
- Lecture Hall Partitions IIThe Ramanujan Journal, 1997
- Lecture Hall PartitionsThe Ramanujan Journal, 1997
- A bijection for Lebesgue's partition identity in the spirit of SylvesterDiscrete Mathematics, 1994
- A Combinatorial Proof of a Refinement of the Andrews—Olsson Partition IdentityEuropean Journal of Combinatorics, 1991
- On generalizations of Euler's partition theorem.Michigan Mathematical Journal, 1966