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

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.