The case k=a of the 1974 conjecture of Andrews on two partition functions Aλ,k,a(n) and Bλ,k,a(n) was proved by the first author and Sudha (1993) and the case k=a+1 was established by the authors (2000). In this paper, we prove that the conjecture is false and give a revised conjecture for a particular case when λ is even
Abstract. Following G.E. Andrews, let q∗d(n) (resp. Q d(n)) be the number of partitions of n into d-...
AbstractAndrews has established a refinement of the generating function for partitions π according t...
AbstractIn 1974, Andrews discovered the generating function for the partitions of n considered in a ...
The case k = a of the 1974 conjecture of Andrews on two partition functions Aλ,k,a(n) and Bλ,k,a(n) ...
Abstract. In 1969, Andrews [3] proved a theorem on partitions with dif-ference conditions which gene...
In this paper, we present a generalization of one of the theorems in Partitions with parts separated...
Abstract. In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which...
AbstractIn (Bessenrodt, 1991) a combinatorial proof of a refinement of the Andrews-Olsson partition ...
In his paper, “On a partition function of Richard Stanley, ” George Andrews proves a certain partiti...
AbstractIn 1994, James Sellers conjectured an infinite family of Ramanujan type congruences for 2-co...
this paper, gave combinatorial proofs to some of the theorems. Much of the fame Fine's long unp...
Abstract. In 1994 James Sellers conjectured an infinite family of Ramanu-jan type congruences for 2-...
Andrews and Olsson [2] have recently proved a general partition identity a special case of which pro...
In this paper we give three new proofs of Schur’s theorem for overpartitions using recurrences and g...
In this paper we verify two conjectures concerning extents of Smarandache factor partitions
Abstract. Following G.E. Andrews, let q∗d(n) (resp. Q d(n)) be the number of partitions of n into d-...
AbstractAndrews has established a refinement of the generating function for partitions π according t...
AbstractIn 1974, Andrews discovered the generating function for the partitions of n considered in a ...
The case k = a of the 1974 conjecture of Andrews on two partition functions Aλ,k,a(n) and Bλ,k,a(n) ...
Abstract. In 1969, Andrews [3] proved a theorem on partitions with dif-ference conditions which gene...
In this paper, we present a generalization of one of the theorems in Partitions with parts separated...
Abstract. In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which...
AbstractIn (Bessenrodt, 1991) a combinatorial proof of a refinement of the Andrews-Olsson partition ...
In his paper, “On a partition function of Richard Stanley, ” George Andrews proves a certain partiti...
AbstractIn 1994, James Sellers conjectured an infinite family of Ramanujan type congruences for 2-co...
this paper, gave combinatorial proofs to some of the theorems. Much of the fame Fine's long unp...
Abstract. In 1994 James Sellers conjectured an infinite family of Ramanu-jan type congruences for 2-...
Andrews and Olsson [2] have recently proved a general partition identity a special case of which pro...
In this paper we give three new proofs of Schur’s theorem for overpartitions using recurrences and g...
In this paper we verify two conjectures concerning extents of Smarandache factor partitions
Abstract. Following G.E. Andrews, let q∗d(n) (resp. Q d(n)) be the number of partitions of n into d-...
AbstractAndrews has established a refinement of the generating function for partitions π according t...
AbstractIn 1974, Andrews discovered the generating function for the partitions of n considered in a ...
DOI
Add to ORKG