A COMBINATORIAL PROOF OF A REFINEMENT OF THE ANDREWS-OLSSON PARTITION IDENTITY

被引：14

作者：

BESSENRODT, C ^{[1
]}

机构：

[1] UNIV ESSEN GESAMTHSCH,INST EXPTL MATH,W-4300 ESSEN 12,GERMANY

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 1991年 / 12卷 / 04期

关键词：

D O I：

10.1016/S0195-6698(13)80109-6

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Andrews and Olsson [2] have recently proved a general partition identity a special case of which provides further evidence for the Mullineux conjecture. Here we present a purely combinatorial proof of this identity by constructing an explicit bijection between the sets of partitions under consideration, which also leads to a refinement of the Andrews—Olsson theorem. © 1991, Academic Press Inc. (London) Limited. All rights reserved.

引用

页码：271 / 276

页数：6