Two-color partitions and overpartitions: a combinatorial proof
Number Theory
2026-05-26 v2 Combinatorics
Abstract
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.
Cite
@article{arxiv.2508.19741,
title = {Two-color partitions and overpartitions: a combinatorial proof},
author = {Anton Bugleev},
journal= {arXiv preprint arXiv:2508.19741},
year = {2026}
}
Comments
updated acknowledgments