Related papers: Number Identities and Integer Partitions
The Rogers-Ramanujan identities and various analogous identities (Gordon, Andrews-Bressoud, Capparelli, etc.) form a family of very deep identities concerned with integer partitions. These identities (written in generating function form)…
We propose and recursively prove polynomial identities which imply Capparelli's partition theorems. We also find perfect companions to the results of Andrews, and Alladi, Andrews and Gordon involving $q$-trinomial coefficients. We follow…
We prove recursive formulas involving sums of divisors and sums of triangular numbers and give a variety of identities relating arithmetic functions to divisor functions providing inductive identities for such arithmetic functions.
We define a class of expressions for the multiple zeta function, and show how to determine whether an expression in the class vanishes identically. The class of such identities, which we call partition identities, is shown to coincide with…
We propose a method to construct a variety of partition identities at once. The main application is an all-moduli generalization of some of Andrews' results in [5]. The novelty is that the method constructs solutions to functional equations…
Two types of finite series of products of harmonic numbers involving nonnegative integer powers are evaluated, also yielding two other important harmonic number identities. The recursion formulas for these sums are derived, which are easily…
In this paper we present a new identity and some of its variants which can be used for finding solutions while solving fractional infinite and finite series. We introduce another simple identity which is capable of generating solutions for…
We prove a pair of (mod 10) partition identities. The sum sides involve three-colored partitions into distinct parts, while the product sides are the generating functions for distinct partitions times the Rogers-Ramanujan products. Our…
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes…
Product identities in two variables $x, q$ expand infinite products as infinite sums, which are linear combinations of theta functions; famous examples include Jacobi's triple product identity, Watson's quintuple identity, and Hirschhorn's…
In this paper, we investigate the combinatorial properties of three classes of integer partitions: (1) $s$-modular partitions, a class consisting of partitions into parts with a number of occurrences (i.e., multiplicity) congruent to $0$ or…
The partition function $p(n)$, which counts the number of partitions of a positive integer $n$, is widely studied. Here, we study partition functions $p_S(n)$ that count partitions of $n$ into distinct parts satisfying certain congruence…
A product difference equation is proved and used for derivation by elementary methods of four combinatorial identities, eight combinatorial identities involving generalized harmonic numbers and eight combinatorial identities involving…
Touchard-Riordan-like formulas are some expressions appearing in enumeration problems and as moments of orthogonal polynomials. We begin this article with a new combinatorial approach to prove these kind of formulas, related with integer…
We use an integral method to establish a number of Rogers-Ramanujan type identities involving double and triple sums. The key step for proving such identities is to find some infinite products whose integrals over suitable contours are…
Let ${{B}_{3}}(n)$ denote the number of partition triples of $n$ where each partition is 3-core. With the help of generating function manipulations, we find several infinite families of arithmetic identities and congruences for…
We give a series of recursive identities for the number of partitions with exactly $k$ parts and with constraints on both the minimal difference among the parts and the minimal part. Using these results we demonstrate that the number of…
We present a new partition identity and give a combinatorial proof of our result. This generalizes a result of Andrew's in which he considers the generation function for partitions with respect to size, number of odd parts, and number of…
We show that, in many cases, there are infinitely many sets of partitions corresponding to a single analytical Rogers-Ramanujan type identity. This means that a single analytical Rogers-Ramanujan type identity implies the existence of…
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…