Related papers: Combinatorial proofs of several partition identiti…
Recently, Andrews and Merca have given a new combinatorial interpretation of the total number of even parts in all partitions of n into distinct parts. We generalise this result and consider many more variations of their work. We also…
Recently, Andrews and EI Bachraoui obtained several iden tities on two-colored partitions. While solving open problems they posed, Chen and Zhou derived a number of identities using analytic methods and asked for combinatorial proofs. In…
Recently Andrews and Bachraoui proved identities relating certain restricted partitions into distinct even parts with restricted 4-regular partitions by the theory of basic hypergeometric series. They also posed a question regarding…
Recently, Andrews and Yee studied two-variable generalizations of two identities involving partition functions $p_\omega(n)$ and $p_\nu(n)$ introduced by Andrews, Dixit and Yee. In this paper, we present a combinatorial proof of an…
We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews…
In his paper, "On a Partition Function of Richard Stanley," George Andrews proves a certain partition identity analytically and asks for a combinatorial proof. This paper provides the requested combinatorial proof.
Recently, Andrews and EI Bachraoui discovered several companions for some famous $q$-series formulas, and derived some new identities involving partitions and overpartitions with distinct parts. In this paper, we shall refine their results…
Andrews and Merca [J. Combin. Theory Ser. A 203 (2024), Art. 105849] recently obtained two interesting results on the sum of the parts with the same parity in the partitions of $n$ (the modulo $2$ case), the proof of which relies on…
In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…
Partitions with distinct even parts have long been the subject of extensive research. In this paper, We present some new perspectives on such partitions from a combinatorial viewpoint, and connect them with signed partitions and bicolored…
We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…
The two partition functions $p_\omega(n)$ and $p_\nu(n)$ were introduced by Andrews, Dixit and Yee, which are related to the third order mock theta functions $\omega(q)$ and $\nu(q)$, respectively. Recently, Andrews and Yee analytically…
Recently, Andrews and El Bachraoui (2024) proved three very interesting $q$-series identities, from which three simple looking identities involving certain restricted partitions into distinct even parts and $4$-regular partitions follow. In…
The restricted partitions in which the largest part is less than or equal to $N$ and the number of parts is less than or equal to $k$ were investigated by Andrews in \cite{Andrews76}. These partitions were extended recently by the author to…
We provide combinatorial tools inspired by work of Warnaar to give combinatorial interpretations of the sum sides of the Andrews-Gordon and Bressoud identities. More precisely, we give an explicit weight- and length-preserving bijection…
Recently, Andrews and El Bachraoui considered the number of integer partitions whose smallest part is repeated exactly $k$ times and the remaining parts are not repeated. They presented several interesting results and posed questions…
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.…
We present a new partition identity and give a combinatorial proof of our result. This generalizes a result of Andrew's in which he considers the generation function for partitions with respect to size, number of odd parts, and number of…
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the…
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…