AbstractWe use q-functional equations to prove some (n + t)-color partition identities. Generating functions for all odd-even partitions, odd-even partitions with rank ≡ 0 (mod 4) and odd-even partitions with rank ≡ 2 (mod 4) are also obtained via q-functional equations
AbstractThe goal of this paper is to prove new recurrences involving 2-colored and 3-colored general...
Three new partition identities are found for two-color partitions. The first relates to ordinary par...
AbstractLet p(n) denote the number of partitions of an integer n. Recently, the author has shown tha...
AbstractWe use q-functional equations to prove some (n + t)-color partition identities. Generating f...
Let p_r(n) denote the difference between the number of r-colored partitions of n into an even number...
Andrews [Generalized Frobenius partitions. Memoirs of the American Math. Soc., 301:1{44, 1984] defin...
AbstractFori=1, 2, 3, 4, letQi(n) denote the number of partitions of n into distinct parts ≢ (mod4)....
We propose a method to construct a variety of partition identities at once. The main application is...
summary:We provide combinatorial interpretations for three new classes of partitions, the so-called ...
AbstractThe goal of this paper is to prove new congruences involving 2-colored and 3-colored general...
Integer partitions play important roles in diverse areas of mathematics such as q-series, the theory...
AbstractThe technique of combinatorial mapping is used to obtain various partition identities, some ...
AbstractIn his memoir in 1984, George E. Andrews introduces many general classes of Frobenius partit...
AbstractLet T(n) denote the number of partitions of n into parts which are repeated exactly 1, 3, 4,...
In the present paper we use anti-hook differences of Agarwal and Andrews as an elementary tool to pr...
AbstractThe goal of this paper is to prove new recurrences involving 2-colored and 3-colored general...
Three new partition identities are found for two-color partitions. The first relates to ordinary par...
AbstractLet p(n) denote the number of partitions of an integer n. Recently, the author has shown tha...
AbstractWe use q-functional equations to prove some (n + t)-color partition identities. Generating f...
Let p_r(n) denote the difference between the number of r-colored partitions of n into an even number...
Andrews [Generalized Frobenius partitions. Memoirs of the American Math. Soc., 301:1{44, 1984] defin...
AbstractFori=1, 2, 3, 4, letQi(n) denote the number of partitions of n into distinct parts ≢ (mod4)....
We propose a method to construct a variety of partition identities at once. The main application is...
summary:We provide combinatorial interpretations for three new classes of partitions, the so-called ...
AbstractThe goal of this paper is to prove new congruences involving 2-colored and 3-colored general...
Integer partitions play important roles in diverse areas of mathematics such as q-series, the theory...
AbstractThe technique of combinatorial mapping is used to obtain various partition identities, some ...
AbstractIn his memoir in 1984, George E. Andrews introduces many general classes of Frobenius partit...
AbstractLet T(n) denote the number of partitions of n into parts which are repeated exactly 1, 3, 4,...
In the present paper we use anti-hook differences of Agarwal and Andrews as an elementary tool to pr...
AbstractThe goal of this paper is to prove new recurrences involving 2-colored and 3-colored general...
Three new partition identities are found for two-color partitions. The first relates to ordinary par...
AbstractLet p(n) denote the number of partitions of an integer n. Recently, the author has shown tha...
DOI
Add to ORKG