Combinatorial Proofs for Overpartitions and Two-Colored Partitions II
The Electronic Journal of Combinatorics · 2026-04-24 · 33 (2)
DOI: 10.37236/14832 ↗At a glance
Journal article in The Electronic Journal of Combinatorics, published online on 2026-04-24. Written by Dandan Chen and 1 co-authors.
Abstract (original language)
Andrews and El Bachraoui recently studied various two-colored integer partitions, including those related to two-colored partitions into distinct parts with constraints and overpartitions. Their work raised questions about the existence of combinatorial proofs for these results, which were partially addressed by the first author and Zou. This paper provides combinatorial proofs for the remaining results concerning two-colored partitions and overpartitions with constraints.
Cite
APA
Chen, D., & Liu, J. (2026). Combinatorial Proofs for Overpartitions and Two-Colored Partitions II. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/14832
Vancouver
Chen D, Liu J. Combinatorial Proofs for Overpartitions and Two-Colored Partitions II. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/14832
BibTeX
@article{Chen2026,
author = {Chen, Dandan and Liu, Jiahao},
title = {Combinatorial Proofs for Overpartitions and Two-Colored Partitions II},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {2},
doi = {10.37236/14832}
}
EUVIMED