Generalisations of the Andrews-Olsson pa
โ
Christine Bessenrodt
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 523 KB
In (Bessenrodt, 1991) a combinatorial proof of a refinement of the Andrews-Olsson partition identity (Andrews and Olsson, 1991) was given. In this article we explore the methods of (Bessenrodt, 1991) further to deal also with partitions where repetitions are allowed and where the restrictions on the