Combinatorial proofs and refinements of three partition theorems of Andrews

Abstract

In his recent work, Andrews revisited two-color partitions with certain restrictions on the differences between consecutive parts, and he established three theorems linking these two-color partitions with more familiar kinds of partitions. In this note, we provide bijective proofs as well as refinements of those three theorems of Andrews. Our refinements take into account the numbers of parts in each of the two colors.

11 pages, 2 figures, comments are welcome