In a work of 1995, Alladi, Andrews, and Gordon provided a generalization of the two Capparelli identities involving certain classes of integer partitions. Inspired by that contribution, in particular as regards the general setting and the tools the authors employed, we obtain new partition identities by identifying further sets of partitions that can be explicitly put into a one-to-one correspondence by the method described in the 1995 paper. As a further result, although of a different nature, we obtain an analytical identity of Rogers-Ramanujan type, involving generating functions, for a class of partition identities already found in that paper and that generalize the first Capparelli identity and include it as a particular case. To achieve this, we apply the same strategy as Kanade and Russel did in a recent paper. This method relies on the use of jagged partitions that can be seen as a more general kind of integer partitions.
Let $\mathscr{S}$ denote the set of integer partitions into parts that differ by at least $3$, with the added constraint that no two consecutive multiples of $3$ occur as parts. We derive trivariate generating functions of Andrews--Gordon type for partitions in $\mathscr{S}$ with both the number of parts and the number of even parts counted. In particular, we provide an analytic counterpart of Andrews' recent refinement of the Alladi--Schur theorem.
We prove a general theorem on overpartitions with difference conditions that unifies generalisations of Schur's theorem due to Alladi-Gordon, Andrews, Corteel-Lovejoy and the author. This theorem also allows one to give companions and refinements of the generalisations of Andrews' theorems to overpartitions. The proof relies on the method of weighted words of Alladi and Gordon and $q$-difference equation techniques introduced recently by the author.
We find an involution as a combinatorial proof of a Ramanujan's partial theta identity. Based on this involution, we obtain a Franklin type involution for squares in the sense that the classical Franklin involution provides a combinatorial interpretation of Euler's pentagonal number theorem. This Franklin type involution can be considered as a solution to a problem proposed by Pak concerning the parity of the number of partitions of n into distinct parts with the smallest part being odd. Using a weighted form of our involution, we give a combinatorial proof of a weighted partition theorem deri…
Alladi and Gordon introduced the method of weighted words in 1993 to prove a refinement and generalisation of Schur's partition identity. Together with Andrews, they later used it to refine Capparelli's and Göllnitz' identities too. In this paper, we present a new variant of this method, which can be used to study more complicated partition identities, and apply it to prove refinements and generalisations of three partition identities. The first one, Siladić's theorem (2002), comes from vertex operator algebras. The second one, a conjectural identity of Primc (1999), comes from crystal base th…
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 Kurşungöz's ideas to provide direct combinatorial interpretations of some of our expressions. We use of the trinomial analogue of Bailey's lemma to derive new identities. These identities relate triple sums and products. A couple of new Slater type identities are also noted.
In 2003, Alladi, Andrews and Berkovich proved an identity for partitions where parts occur in eleven colors: four primary colors, six secondary colors, and one quaternary color. Their work answered a longstanding question of how to go beyond a classical theorem of Göllnitz, which uses three primary and three secondary colors. Their main tool was a deep and difficult four parameter $q$-series identity. In this paper we take a different approach. Instead of adding an eleventh quaternary color, we introduce forbidden patterns and give a bijective proof of a ten-colored partition identity lying be…
Capparelli conjectured two modular identities for partitions whose parts satisfy certain gap conditions, where were motivated by the calculation of characters for the standard modules of certain affine Lie algebras and by vertex operator theory. These identities were subsequently proved and refined by Andrews, who related them to Jacobi theta functions, and also by Alladi-Andrews-Gordon, Capparelli, and Tamba-Xie. In this paper we prove two new companions to Capparelli's identities, where the evaluations are expressed in terms of Jacobi theta functions and false theta functions.
In $2003$, Alladi, Andrews and Berkovich proved a four-parameter partition identity lying beyond a celebrated identity of Göllnitz. Since then it has been an open problem to extend their work to five or more parameters. In part I of this pair of papers, we took a first step in this direction by giving a bijective proof of a reformulation of their result. We introduced forbidden patterns, bijectively proved a ten-colored partition identity, and then related, by another bijection, our identity to the Alladi-Andrews-Berkovich identity. In this second paper, we state and bijectively prove an $\fra…
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the combinatorial objects corresponding to a sum of positive terms, we establish bijections that lead a telescoping relation. We illustrate this idea by giving a combinatorial telescoping relation for a classical identity of MacMahon. Recently, Andrews posed a problem of finding a combinatorial proof of an identity on the q-little Jacobi polynomials which was derived bas…
We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a previous paper by the author , enable us to state and prove new generalizations of two of these results.
In this paper, we give a purely bijective proof that two different partition classes that are both combinatorial interpretations of the partition function $p_ν(n)$, a partition function related to the third order mock theta function $ν(q)$, are equinumerous. In doing so, we give a partial solution to a combinatorial problem proposed in a paper by Andrews.
We prove a new four parameter q-hypergeometric series identity from which the three parameter key identity for the Goellnitz theorem due to Alladi, Andrews, and Gordon, follows as a special case by setting one of the parameters equal to 0. The new identity is equivalent to a four parameter partition theorem which extends the deep theorem of Goellnitz and thereby settles a problem raised by Andrews thirty years ago. Some consequences including a quadruple product extension of Jacobi's triple product identity, and prospects of future research are briefly discussed.
We extend results of Andrews and Bressoud on the vanishing of coefficients in the series expansions of certain infinite products. These results have the form that if \begin{equation*} \frac{(q^{r-tk}, q^{mk-(r-tk)}; q^{mk})_\infty}{(q^r,q^{mk-r}; q^{mk})_\infty} =: \sum_{n=0}^\infty c_nq^n, \end{equation*} for certain integers $k$, $m$ $s$ and $t$, where $r=sm+t$, then $c_{kn-rs}$ is always zero. Our theorems also partly give a simpler reformulation of results of Alladi and Gordon, but also give results for cases not covered by the theorems of Alladi and Gordon. We also give some interpretatio…
The main result of this paper is a bijective proof showing that the generating function for partitions with bounded differences between largest and smallest part is a rational function. This result is similar to the closely related case of partitions with fixed differences between largest and smallest parts which has recently been studied through analytic methods by Andrews, Beck, and Robbins. Our approach is geometric: We model partitions with bounded differences as lattice points in an infinite union of polyhedral cones. Surprisingly, this infinite union tiles a single simplicial cone. This …
The spt-function $spt(n)$ was introduced by Andrews as the weighted counting of partitions of $n$ with respect to the number of occurrences of the smallest part. Andrews, Garvan and Liang defined the spt-crank of an $S$-partition which leads to combinatorial interpretations of the congruences of $spt(n)$ mod 5 and 7. Let $N_S(m,n)$ denote the net number of $S$-partitions of $n$ with spt-crank $m$. Andrews, Garvan and Liang showed that $N_S(m,n)$ is nonnegative for all integers $m$ and positive integers $n$, and they asked the question of finding a combinatorial interpretation of $N_S(m,n)$. In…
We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part congruent to zero modulo the length of the partition. It turns out these obscure-seeming objects are embedded in a natural way in partition theory. We show that sequentially congruent partitions with largest part $n$ are in bijection with the partitions of $n$. Moreover, we show sequentially congruent partitions induce a bijection between partitions of $n$ and parti…
In answer to a question of Andrews about finding combinatorial proofs of two identities in Ramanujan's "Lost" Notebook, we obtain weighted forms of Euler's theorem on partitions with odd parts and distinct parts. This work is inspired by the insight of Andrews on the connection between Ramanujan's identities and Euler's theorem. Our combinatorial formulations of Ramanujan's identities rely on the notion of rooted partitions. Iterated Dyson's map and Sylvester's bijection are the main ingredients in the weighted forms of Euler's theorem.
Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of 3. We establish a double bounded refined version of this theorem by imposing one bound on the parts congruent 0,1 (mod 3) and another on the parts congruent 2 (mod 3), and by keeping track of the number of parts in each of the residue classes (mod 3). Despite the long history of Schur's theorem, our result is new, and extends earlier work of Andrews, Alladi-G…
Given integers i,j,k,L,M, we establish a new double bounded q-series identity from which the three parameter (i,j,k) key identity of Alladi-Andrews-Gordon for Goellnitz's (big) theorem follows if L, M tend to infinity. When L = M, the identity yields a strong refinement of Goellnitz's theorem with a bound on the parts given by L. This is the first time a bounded version of Goellnitz's (big) theorem has been proved. This leads to new bounded versions of Jacobi's triple product identity for theta functions and other fundamental identities.
We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews via generating functions. Let $a(n)$ be the number of partitions of $n$ such that the set of even parts has exactly one element, $b(n)$ be the difference between the number of parts in all odd partitions of $n$ and the number of parts in all distinct partitions of $n$, and $c(n)$ be the number of partitions of $n$ in which exactly one part is repeated. Then,…
