Two-color partitions and overpartitions: a combinatorial proof
George Andrews and Mohamed El Bachraoui recently explored identities for two-color partitions. In particular, they studied the connection between two-colored partitions and overpartitions. Their proofs were analytical, but they conjectured combinatorial proofs of their results. In this paper we use two-modular diagrams to give a combinatorial proof of their main result.
math.NT↗