DOIAbstract
AbstractAn involution on the set of pairs of partitions of integers into distinct parts is given which proves an identity of Hecke–Rogers. A bijection shows equivalence with an identity of Andrews
AbstractAn involution on the set of pairs of partitions of integers into distinct parts is given which proves an identity of Hecke–Rogers. A bijection shows equivalence with an identity of Andrews
AbstractA simple involution on the set of triples of partitions into distinct parts is given which p...
We give a combinatorial proof of an identity originally proved by G. E. Andrews. The identity simpl...
In 2017, Beck conjectured that the difference in the number of parts in all partitions of $n$ into o...
Andrews and Olsson [2] have recently proved a general partition identity a special case of which pro...
AbstractWe analyze involutions which prove several partition identities and describe them in a unifo...
AbstractRecently Andrews proposed a problem of finding a combinatorial proof of an identity on the q...
In his paper, “On a partition function of Richard Stanley, ” George Andrews proves a certain partiti...
AbstractIn (Bessenrodt, 1991) a combinatorial proof of a refinement of the Andrews-Olsson partition ...
In this paper we give combinatorial proofs for two partition identities. The first one solves a rece...
In this paper, we present a generalization of one of the theorems in Partitions with parts separated...
AbstractWe demonstrate the correspondence which lies behind certain partition identities used by And...
A general theorem for providing a class of combinatorial identities where the sum is over all the pa...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the firs...
Based on the combinatorial proof of Schur’s partition theorem given by Bressoud, and the combinatori...
National audienceWe prove an identity about partitions, previously conjectured in the study of shift...
AbstractA simple involution on the set of triples of partitions into distinct parts is given which p...
We give a combinatorial proof of an identity originally proved by G. E. Andrews. The identity simpl...
In 2017, Beck conjectured that the difference in the number of parts in all partitions of $n$ into o...
Andrews and Olsson [2] have recently proved a general partition identity a special case of which pro...
AbstractWe analyze involutions which prove several partition identities and describe them in a unifo...
AbstractRecently Andrews proposed a problem of finding a combinatorial proof of an identity on the q...
In his paper, “On a partition function of Richard Stanley, ” George Andrews proves a certain partiti...
AbstractIn (Bessenrodt, 1991) a combinatorial proof of a refinement of the Andrews-Olsson partition ...
In this paper we give combinatorial proofs for two partition identities. The first one solves a rece...
In this paper, we present a generalization of one of the theorems in Partitions with parts separated...
AbstractWe demonstrate the correspondence which lies behind certain partition identities used by And...
A general theorem for providing a class of combinatorial identities where the sum is over all the pa...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the firs...
Based on the combinatorial proof of Schur’s partition theorem given by Bressoud, and the combinatori...
National audienceWe prove an identity about partitions, previously conjectured in the study of shift...
AbstractA simple involution on the set of triples of partitions into distinct parts is given which p...
We give a combinatorial proof of an identity originally proved by G. E. Andrews. The identity simpl...
In 2017, Beck conjectured that the difference in the number of parts in all partitions of $n$ into o...
Add to ORKG