Combinatorial proofs and refinements of three partition theorems of Andrews
Combinatorics
2022-02-08 v1
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.
Cite
@article{arxiv.2202.02745,
title = {Combinatorial proofs and refinements of three partition theorems of Andrews},
author = {Shishuo Fu},
journal= {arXiv preprint arXiv:2202.02745},
year = {2022}
}
Comments
11 pages, 2 figures, comments are welcome