2010
DOI: 10.1007/s11139-008-9156-7
|View full text |Cite
|
Sign up to set email alerts
|

A unification of two refinements of Euler’s partition theorem

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
references
References 17 publications
0
0
0
Order By: Relevance