The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most $p$, are related by double summation identities which follow from their generating functions. From these identities and some identities from an earlier paper, some other identities involving distinct partitions and some q-binomial summation identities are proved, and from these follow some combinatorial identities
Abstract. We study the number p(n, t) of partitions of n with difference t between largest and small...
In this paper, parity and recurrence formulas for some partition functions are given. In particular,...
Abstract. This paper considers a variety of parity questions connected with classical partition iden...
Integer partitions play important roles in diverse areas of mathematics such as q-series, the theory...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
Abstract. We give a series of recursive identities for the number of partitions with exactly k parts...
In the previous paper [Z] D. Zeilberger asks for an elementary, non-combinatorial proof of the ident...
We focus on writing double sum representations of the generating functions for the number of partiti...
AbstractWe study the generating function for Q(n), the number of partitions of a natural number n in...
Let p(n) denote the number of partitions of the integer n. The first exact formula for p(n) was publ...
. Some algebraic identities with independent variables are established by means of the calculus on f...
Partition function P(n) is defined as the number of ways that a positive integer can be expressed as...
AbstractWe study the number of partitions of n into k different parts by constructing a generating f...
This dissertation involves two topics. The first is on the theory of partitions, which is discussed ...
Abstract. We study the number p(n, t) of partitions of n with difference t between largest and small...
In this paper, parity and recurrence formulas for some partition functions are given. In particular,...
Abstract. This paper considers a variety of parity questions connected with classical partition iden...
Integer partitions play important roles in diverse areas of mathematics such as q-series, the theory...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
The first chapter examines $p_b(n)$, the number of partitions of $n$ into powers of $b$, along with ...
Abstract. We give a series of recursive identities for the number of partitions with exactly k parts...
In the previous paper [Z] D. Zeilberger asks for an elementary, non-combinatorial proof of the ident...
We focus on writing double sum representations of the generating functions for the number of partiti...
AbstractWe study the generating function for Q(n), the number of partitions of a natural number n in...
Let p(n) denote the number of partitions of the integer n. The first exact formula for p(n) was publ...
. Some algebraic identities with independent variables are established by means of the calculus on f...
Partition function P(n) is defined as the number of ways that a positive integer can be expressed as...
AbstractWe study the number of partitions of n into k different parts by constructing a generating f...
This dissertation involves two topics. The first is on the theory of partitions, which is discussed ...
Abstract. We study the number p(n, t) of partitions of n with difference t between largest and small...
In this paper, parity and recurrence formulas for some partition functions are given. In particular,...
Abstract. This paper considers a variety of parity questions connected with classical partition iden...