AbstractA simple combinatorial argument, based upon the graphic representation of partitions, leads to an explicit formula for the number of partitions of an integer with a given difference between the largest part and the number of parts. Euler's formula for the reciprocal of the partition generating function is an immediate corollary
Abstract. We present a new partition identity and give a combinatorial proof of our result. This gen...
AbstractMacMahon conjectured the form of the generating function for symmetrical plane partitions, a...
AbstractThe technique of combinatorial mapping is used to obtain various partition identities, some ...
AbstractA simple combinatorial argument, based upon the graphic representation of partitions, leads ...
AbstractThe technique of combinatorial mapping is used to obtain various partition identities, some ...
Euler’s Partition Theorem states that the number of partitions with only distinct parts is equal to ...
Euler’s Partition Theorem states that the number of partitions with only distinct parts is equal to ...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the first...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the firs...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the first...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the firs...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the first...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the firs...
Let p(n) denote the number of partitions of the integer n. The first exact formula for p(n) was publ...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the firs...
Abstract. We present a new partition identity and give a combinatorial proof of our result. This gen...
AbstractMacMahon conjectured the form of the generating function for symmetrical plane partitions, a...
AbstractThe technique of combinatorial mapping is used to obtain various partition identities, some ...
AbstractA simple combinatorial argument, based upon the graphic representation of partitions, leads ...
AbstractThe technique of combinatorial mapping is used to obtain various partition identities, some ...
Euler’s Partition Theorem states that the number of partitions with only distinct parts is equal to ...
Euler’s Partition Theorem states that the number of partitions with only distinct parts is equal to ...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the first...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the firs...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the first...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the firs...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the first...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the firs...
Let p(n) denote the number of partitions of the integer n. The first exact formula for p(n) was publ...
In 1748, Euler published his Introductio in Analysin Infinitorum. Chapter 16 of this work is the firs...
Abstract. We present a new partition identity and give a combinatorial proof of our result. This gen...
AbstractMacMahon conjectured the form of the generating function for symmetrical plane partitions, a...
AbstractThe technique of combinatorial mapping is used to obtain various partition identities, some ...
DOI
Add to ORKG