Add to ORKGWe present two analogues of two well-known elementary arguments for a lower bound for p(n), the number of partitions of the integer n. One of these is character-theoretic, and the other relies on partition combinatorics developed and used in the theory of representations of the symmetric group. We show that these arguments provide better lower estimates. We also give an application. 1
AbstractLet p(n) be the number of partitions of a non-negative integer n. In this paper we prove tha...
AbstractLet p(n) denote the number of unrestricted partitions of n. For i=0, 2, let pi(n) denote the...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
We present two analogues of two well-known elementary arguments for a lower bound for p(n), the numb...
We present two analogues of two well-known elementary arguments for a lower bound for p(n), the numb...
The parity of p(n), the ordinary partition function, has been studied for at least a century, yet it...
The parity of p(n), the ordinary partition function, has been studied for at least a century, yet it...
Abstract.Let S denote a subset of the positive integers, and let pS(n) be the associated partition f...
This small project comprises of some introductory properties and topics of the partition function p(...
We prove a lemma that is useful to get upper bounds for the number of partitions without a given sub...
We prove a lemma that is useful to get upper bounds for the number of partitions without a given sub...
AbstractLet N be the set of all positive integers and D a subset of N. Let p(D,n) be the number of p...
We obtain a combinatorial proof of a surprising weighted partition equality of Berkovich and Uncu. O...
Let p(n) denote the number of partitions of the integer n. The first exact formula for p(n) was publ...
We prove various inequalities between the number of partitions with the bound on the largest part an...
AbstractLet p(n) be the number of partitions of a non-negative integer n. In this paper we prove tha...
AbstractLet p(n) denote the number of unrestricted partitions of n. For i=0, 2, let pi(n) denote the...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
We present two analogues of two well-known elementary arguments for a lower bound for p(n), the numb...
We present two analogues of two well-known elementary arguments for a lower bound for p(n), the numb...
The parity of p(n), the ordinary partition function, has been studied for at least a century, yet it...
The parity of p(n), the ordinary partition function, has been studied for at least a century, yet it...
Abstract.Let S denote a subset of the positive integers, and let pS(n) be the associated partition f...
This small project comprises of some introductory properties and topics of the partition function p(...
We prove a lemma that is useful to get upper bounds for the number of partitions without a given sub...
We prove a lemma that is useful to get upper bounds for the number of partitions without a given sub...
AbstractLet N be the set of all positive integers and D a subset of N. Let p(D,n) be the number of p...
We obtain a combinatorial proof of a surprising weighted partition equality of Berkovich and Uncu. O...
Let p(n) denote the number of partitions of the integer n. The first exact formula for p(n) was publ...
We prove various inequalities between the number of partitions with the bound on the largest part an...
AbstractLet p(n) be the number of partitions of a non-negative integer n. In this paper we prove tha...
AbstractLet p(n) denote the number of unrestricted partitions of n. For i=0, 2, let pi(n) denote the...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...