Add to ORKGthis paper, gave combinatorial proofs to some of the theorems. Much of the fame Fine's long unpublished results have owes to Andrews's work and persistence (see [A1-A8]
AbstractWe utilize Dyson' concept of the adjoint of a partition to derive an infinite family of new ...
AbstractThe discovery of some partition function congruences by Ramanujan, and subsequent research m...
AbstractIn 1974, Andrews discovered the generating function for the partitions of n considered in a ...
In this article the rank of a partition of an integer is a certain integer associated with the parti...
Andrews and Olsson [2] have recently proved a general partition identity a special case of which pro...
In his paper, “On a partition function of Richard Stanley, ” George Andrews proves a certain partiti...
Based on the combinatorial proof of Schur’s partition theorem given by Bressoud, and the combinatori...
The case k = a of the 1974 conjecture of Andrews on two partition functions Aλ,k,a(n) and Bλ,k,a(n) ...
AbstractIn (Bessenrodt, 1991) a combinatorial proof of a refinement of the Andrews-Olsson partition ...
In this paper, we present a generalization of one of the theorems in Partitions with parts separated...
Abstract. In 1969, Andrews [3] proved a theorem on partitions with dif-ference conditions which gene...
In this paper we give combinatorial proofs for two partition identities. The first one solves a rece...
The case k=a of the 1974 conjecture of Andrews on two partition functions Aλ,k,a(n) and Bλ,k,a(n) wa...
Abstract. In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which...
AbstractA Combinatorial lemma due to Zolnowsky is applied to partition theory in a new way. Several ...
AbstractWe utilize Dyson' concept of the adjoint of a partition to derive an infinite family of new ...
AbstractThe discovery of some partition function congruences by Ramanujan, and subsequent research m...
AbstractIn 1974, Andrews discovered the generating function for the partitions of n considered in a ...
In this article the rank of a partition of an integer is a certain integer associated with the parti...
Andrews and Olsson [2] have recently proved a general partition identity a special case of which pro...
In his paper, “On a partition function of Richard Stanley, ” George Andrews proves a certain partiti...
Based on the combinatorial proof of Schur’s partition theorem given by Bressoud, and the combinatori...
The case k = a of the 1974 conjecture of Andrews on two partition functions Aλ,k,a(n) and Bλ,k,a(n) ...
AbstractIn (Bessenrodt, 1991) a combinatorial proof of a refinement of the Andrews-Olsson partition ...
In this paper, we present a generalization of one of the theorems in Partitions with parts separated...
Abstract. In 1969, Andrews [3] proved a theorem on partitions with dif-ference conditions which gene...
In this paper we give combinatorial proofs for two partition identities. The first one solves a rece...
The case k=a of the 1974 conjecture of Andrews on two partition functions Aλ,k,a(n) and Bλ,k,a(n) wa...
Abstract. In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which...
AbstractA Combinatorial lemma due to Zolnowsky is applied to partition theory in a new way. Several ...
AbstractWe utilize Dyson' concept of the adjoint of a partition to derive an infinite family of new ...
AbstractThe discovery of some partition function congruences by Ramanujan, and subsequent research m...
AbstractIn 1974, Andrews discovered the generating function for the partitions of n considered in a ...