In a recent study of sign-balanced, labelled posets Stanley, introduced a new integral partition statistic srank(pi) = O(pi) - O(pi'), where O(pi) denotes the number of odd parts of the partition pi and pi' is the conjugate of pi. Andrews proved the following refinement of Ramanujan's partition congruence mod 5: p[0](5n +4) = p[2](5n + 4) = 0 (mod 5), p(n) = p[0](n) + p[2](n), where p[i](n) (i = 0; 2) denotes the number of partitions of n with srank = i (mod 4) and p(n) is the number of unrestricted partitions of n. Andrews asked for a partition statistic that would divide the partitions enumerated by p[i](5n + 4) (i = 0, 2) into five equinumerous classes. In this paper we discuss three such statistics: the St-crank, the 2-quotient-rank and the 5-core-crank. The first one, while new, is intimately related to the Andrews-Garvan crank. The second one is in terms of the 2-quotient of a partition. The third one was introduced by Garvan, Kim and Stanton. We use it in our combinatorial proof of the Andrews refinement. Remarkably, the Andrews result is a simple consequence of a stronger refinement of Ramanujan's congruence mod 5. This more general refinement uses a new partition statistic which we term the BG-rank. We employ the BG-rank to prove new partition congruences modulo 5. Finally, we discuss some new formulas for partitions that are 5-cores and discuss an intriguing relation between 3-cores and the Andrews-Garvan crank.
In a recent study of sign-balanced, labelled posets Stanley [13], introduced a new integral partition statistic srank(pi) = O(pi) - O(pi'), where O(pi) denotes the number of odd parts of the partition pi and pi' the conjugate of pi. In [1] Andrews proved the following refinement of Ramanujan's partition congruence mod 5: p[0](5n +4) = p[2](5n + 4) = 0 (mod 5), p(n) = p[0](n) + p[2](n), where p[i](n) (i = 0, 2) denotes the number of partitions of n with srank = i (mod 4) and p(n) is the number of unrestricted partitions of n. Andrews asked for a partition statistic that would divide the partiti…
In his paper, "On a Partition Function of Richard Stanley," George Andrews proves a certain partition identity analytically and asks for a combinatorial proof. This paper provides the requested combinatorial proof.
We generalise Euler's partition theorem involving odd parts and different parts for all moduli and provide new companions to Rogers-Ramanujan- Andrews-Gordon identities related to this theorem.
Ramanujan's reciprocity theorem may be considered as a three-variable extension of Jacobi's triple product identity. Using the method of $q$-partial differential equations, we extend Ramanujan's reciprocity theorem to a seven-variable reciprocity formula. The Andrews--Askey integral is a $q$-integral having four parameters with base $q$. Using the same method we extend the Andrews--Askey integral formula to a $q$-integral formula which has seven parameters with base $q$.
In 2010, Andrews considers a variety of parity questions connected to classical partition identities of Euler, Rogers, Ramanujan and Gordon. As a large part in his paper, Andrews considered the partitions by restricting the parity of occurrences of even numbers or odd numbers in the Rogers-Ramanujan-Gordon type. The Rogers-Ramanujan-Gordon type partition was defined by Gordon in 1961 as a combinatorial generalization of the Rogers-Ramaujan identities with odd moduli. In 1974, Andrews derived an identity which can be considered as the generating function counterpart of the Rogers-Ramanujan-Gord…
In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related generating function if the moduli is three. We provide new companions to Rogers-Ramanujan-Andrews-Gordon identities under this conjecture.
Let spt(n) denote the total number of appearances of smallest parts in the partitions of n. Recently, Andrews showed how spt(n) is related to the second rank moment, and proved some surprising Ramanujan-type congruences mod 5, 7 and 13. We prove a generalization of these congruences using known relations between rank and crank moments. We obtain explicit Ramanujan-type congruences for spt(n) mod p for p = 11, 17, 19, 29, 31 and 37. Recently, Bringmann and Ono proved that Dyson's rank function has infinitely many Ramanujan-type congruences. Their proof is non-constructive and utilizes the theor…
It is known that $q$-orthogonal polynomials play an important role in the field of $q$-series and special functions. During studying Dyson's "favorite" identity of Rogers--Ramanujan type, Andrews pointed out that the classical orthogonal polynomials also have surprising applications in the world of $q$. By inserting Chebyshev polynomials of the third and the fourth kinds into Bailey pairs, Andrews derived a family of Rogers--Ramanujan type identities and also results related to mock theta functions and Hecke--type series. In this paper, by constructing a new Bailey pair involving Chebyshev pol…
We show that the sum of the four parameter weights over all ordinary or strict partitions with parts each less than or equal to a given integer $N$ is expressed by the Al-Salam Chihara polynomials. This weight is a generalization of the Andrews-Stanley partition function. As a corollary we prove C. Boulet's results when the sum runs over all ordinary or strict partitions. In the last section we study the weighted sum of Schur's $P$-functions and $Q$-functions, where the sum runs over all strict partitions.
In this note we show how to rederive the $A_2$ Rogers-Ramanujan identities proven by Andrews, Schilling and Warnaar using cylindric partitions. This paper is dedicated to George Andrews for his $80^{th}$ birthday.
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.
In this article, a finite analogue of the generalized sum-of-tails identity of Andrews and Freitas is obtained. We derive several interesting results as special cases of this analogue, in particular, a recent identity of Dixit, Eyyyunni, Maji and Sood. We derive a new extension of Abel's lemma with the help of which we obtain a one-parameter generalization of a sum-of-tails identity of Andrews, Garvan and Liang, an identity of Ramanujan as well as two new results - one for Ramanujan's function $σ(q)$ and another for the function recently introduced by Andrews and Ballantine. Later we introduce…
This paper is concerned with a class of partition functions $a(n)$ introduced by Radu and defined in terms of eta-quotients. By utilizing the transformation laws of Newman, Schoeneberg and Robins, and Radu's algorithms, we present an algorithm to find Ramanujan-type identities for $a(mn+t)$. While this algorithm is not guaranteed to succeed, it applies to many cases. For example, we deduce a witness identity for $p(11n+6)$ with integer coefficients. Our algorithm also leads to Ramanujan-type identities for the overpartition functions $\overline{p}(5n+2)$ and $\overline{p}(5n+3)$ and Andrews--P…
We study Andrews and Berndt's organization of Ramanujan's transformation formulas in Chapter 1 of their book Ramanujan's Lost Notebook, Part II. In the process, we rediscover a bibasic Heine's transformation, which follows from a Fundamental Lemma given by Andrews in 1966, and obtain identities proximal to Ramanujan's entries. We also provide a multibasic generalization of Andrews' 1972 theorem concerning a $q$-analogue of the Lauricella function. Our results only require the $q$-binomial theorem, and are an application of what Andrews and Berndt call 'Heine's Method'.
We extend partition-theoretic work of Andrews, Bressoud, and Burge to overpartitions, defining the notions of successive ranks, generalized Durfee squares, and generalized lattice paths, and then relating these to overpartitions defined by multiplicity conditions on the parts. This leads to many new partition and overpartition identities, and provides a unification of a number of well-known identities of the Rogers-Ramanujan type. Among these are Gordon's generalization of the Rogers-Ramanujan identities, Andrews' generalization of the Göllnitz-Gordon identities, and Lovejoy's ``Gordon's theor…
We find two involutions on partitions that lead to partition identities for Ramanujan's third order mock theta functions $ϕ(-q)$ and $ψ(-q)$. We also give an involution for Fine's partition identity on the mock theta function f(q). The two classical identities of Ramanujan on third order mock theta functions are consequences of these partition identities. Our combinatorial constructions also apply to Andrews' generalizations of Ramanujan's identities.
Let $B_{k,i}(n)$ be the number of partitions of $n$ with certain difference condition and let $A_{k,i}(n)$ be the number of partitions of $n$ with certain congruence condition. The Rogers-Ramanujan-Gordon theorem states that $B_{k,i}(n)=A_{k,i}(n)$. Lovejoy obtained an overpartition analogue of the Rogers-Ramanujan-Gordon theorem for the cases $i=1$ and $i=k$. We find an overpartition analogue of the Rogers-Ramanujan-Gordon theorem in the general case. Let $D_{k,i}(n)$ be the number of overpartitions of $n$ satisfying certain difference condition and $C_{k,i}(n)$ be the number of overpartition…
In a recent work, Andrews defined the singular overpartitions with the goal of presenting an overpartition analogue to the theorems of Rogers--Ramanujan type for ordinary partitions with restricted successive ranks. As a small part of his work, Andrews noted two congruences modulo $3$ for the number of singular overpartitions prescribed by parameters $k=3$ and $i=1$. It should be noticed that this number equals the number of the Rogers--Ramanujan--Gordon type overpartitions with $k=i=3$ which come from the overpartition analogue of Gordon's Rogers--Ramanujan partition theorem introduced by Che…
In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which generalise Schur's celebrated partition identity (1926). Andrews' two generalisations of Schur's theorem went on to become two of the most influential results in the theory of partitions, finding applications in combinatorics, representation theory and quantum algebra. In a recent paper, the author generalised the first of these theorems to overpartitions, using a new technique which consists in going back and forth between $q$-difference equations on generating functions and recurrence equations on thei…
Sang, Shi and Yee, in 2020, found overpartition analogs of Andrews' results involving parity in Rogers-Ramanujan-Gordon identities. Their result partially answered an open question of Andrews'. The open question was to involve parity in overpartition identities. We extend Sang, Shi, and Yee's work to arbitrary moduli, and also provide a missing case in their identities. We also unify proofs of Rogers-Ramanujan-Gordon identities for overpartitions due to Lovejoy and Chen et.al.; Sang, Shi, and Yee's results; and ours. Although verification type proofs are given for brevity, a construction of se…
What follows is a lightly edited version of the author's unpublished master's essay, submitted in partial fulfillment of the requirements of the degree of Master of Arts at the Pennsylvania State University, dated June 1994, written under the supervision of Professor George E. Andrews. It was retyped by the author on November 23, 2022. Obvious typographical errors in the original were corrected without comment; hopefully not too many new errors were introduced during the retyping. Explanatory text added by the author in 2022 is notated by \emph{Remark added in 2022}. After the initial posting …
The celebrated Rogers-Ramanujan identities equate the number of integer partitions of $n$ ($n\in\mathbb N_0$) with parts congruent to $\pm 1 \pmod{5}$ (respectively $\pm 2 \pmod{5}$) and the number of partitions of $n$ with super-distinct parts (respectively super-distinct parts greater than $1$). In this paper, we establish companion identities to the Rogers-Ramanujan identities on the number of parts in all partitions of $n$ of the aforementioned types, in the spirit of earlier work by Andrews and Beck on a partition identity of Euler.
Using the theory of intertwining operators for vertex operator algebras we show that the graded dimensions of the principal subspaces associated to the standard modules for $\hat{\goth{sl}(2)}$ satisfy certain classical recursion formulas of Rogers and Selberg. These recursions were exploited by Andrews in connection with Gordon's generalization of the Rogers--Ramanujan identities and with Andrews' related identities. The present work generalizes the authors' previous work on intertwining operators and the Rogers--Ramanujan recursion.
Andrews, Lewis and Lovejoy introduced the partition function PD(n) as the number of partitions of $n$ with designated summands, where we assume that among parts with equal size, exactly one is designated. They proved that PD(3n+2) is divisible by 3. We obtain a Ramanujan type identity for the generating function of PD(3n+2) which implies the congruence of Andrews, Lewis and Lovejoy. For PD(3n), Andrews, Lewis and Lovejoy showed that the generating function can be expressed as an infinite product of powers of $(1-q^{2n+1})$ times a function $F(q^2)$. We find an explicit formula for $F(q^2)$, wh…
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…
In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and "the total number of 1's that occur in the partitions of $n$". Our generalization states a similar relation between "the sum of the numbers of distinct members in the partitions of $n$" and the total number of 2's or 3's or any general $k$ that occur in the partitions of $n$ and the subsequent integers. We also apply this result to obtain an array of interes…
We study the generating functions for cylindric partitions with profile $(c_1,c_2,c_3)$ for all $c_1,c_2,c_3$ such that $c_1+c_2+c_3=5$. This allows us to discover and prove seven new $A_2$ Rogers-Ramanujan identities modulo $8$ with quadruple sums, related with work of Andrews, Schilling, and Warnaar.
In the historic conference Combinatoire Enumerative[LL] wonderfully organized by Gilbert Labelle and Pierre Leroux there were many stimulating lectures, including a very interesting one by Pierre Leroux himself, who talked about his joint work with Xavier Viennot[LV], on solving differential equations combinatorially! During the problem session of that very same colloque, chaired by Pierre Leroux, Richard Stanley raised some intriguing problems about the enumeration of plane partitions, that he later expanded into a fascinating article[Sta1]. Most of these problems concerned the enumeration of…
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 cla…
We present proofs of two new families of sum-product identities arising from the cylindric partitions paradigm. Most of the presented expressions, the related sum-product identities, and the ingredients for the proofs were first conjectured by Kanade-Russell in the spirit of Andrews-Schilling-Warnaar identities of the $A_2$ Rogers-Ramanujan type. We follow the footsteps of Kanade-Russell while we alter the computations heavily to accomplish our goals.
Recently, $4$-regular partitions into distinct parts are connected with a family of overpartitions. In this paper, we provide a uniform extension of two relations due to Andrews for the two types of partitions. Such an extension is made possible with recourse to a new trivariate Rogers--Ramanujan type identity, which concerns a family of quadruple summations appearing as generating functions for the aforementioned overpartitions. More interestingly, the derivation of this Rogers--Ramanujan type identity is relevant to a certain well-poised basic hypergeometric series.
In this paper, we generalize a few important results in Integer Partitions; namely the results known as Stanley's theorem and Elder's theorem, and the congruence results proposed by Ramanujan for the partition function. We generalize the results of Stanley and Elder from a fixed integer to an array of subsequent integers, and propose an analogue of Ramanujan's congruence relations for the `number of parts' function instead of the partition function. We also deduce the generating function for the `number of parts', and relate the technical results with their graphical interpretations through a …
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) are typically of the form "product side" equals "sum side," with the product side enumerating partitions obeying certain congruence conditions and the sum side obeying certain initial conditions and difference conditions (along with possibly other restrictions). We use symbolic computation to generate various such sum sides and then use Euler's algorithm to se…
Basil Gordon, in the sixties, and George Andrews, in the seventies, generalized the Rogers-Ramanujan identities to higher moduli. These identities arise in many areas of mathematics and mathematical physics. One of these areas is representation theory of infinite dimensional Lie algebras, where various known interpretations of these identities have led to interesting applications. Motivated by their connections with Lie algebra representation theory, we give a new interpretation of a sum related to generalized Rogers-Ramanujan identities in terms of multi-color partitions.
Inspired by Andrews' 2-colored generalized Frobenius partitions, we consider certain weighted 7-colored partition functions and establish some interesting Ramanujan-type identities and congruences. Moreover, we provide combinatorial interpretations of some congruences modulo 5 and 7. Finally, we study the properties of weighted 7-colored partitions weighted by the parity of certain partition statistics.
The notion of broken $k$-diamond partitions was introduced by Andrews and Paule. Let $Δ_k(n)$ denote the number of broken k-diamond partitions of $n$. They also posed three conjectures on the congruences of $Δ_2(n)$ modulo 2, 5 and 25. Hirschhorn and sellers proved the conjectures for modulo 2, and Chan proved cases of modulo 5. For the case of modulo 3, Radu and Sellers obtained an infinite family of congruences for $Δ_2(n)$. In this paper, we obtain two infinite families of congruences for $Δ_2(n)$ modulo 3 based on a formula of Radu and Sellers, the 3-dissection formula of the generating fu…
For any rational number $p_0\ge 1$ we prove an identity of Rogers-Ramanujan-Gordon-Andrews' type. Bijection between the space of states for XXZ model and that of XXX model is constructed.
Andrews recently introduced k-marked Durfee symbols, which are a generalization of partitions that are connected to moments of Dyson's rank statistic. He used these connections to find identities relating their generating functions as well as to prove Ramanujan-type congruences for these objects and find relations between. In this paper we show that the hypergeometric generating functions for these objects are natural examples of quasimock theta functions, which are defined as the holomorphic parts of weak Maass forms and their derivatives. In particular, these generating functions may be view…
We generalize the theory of linked partition ideals due to Andrews using finite automata in formal language theory and apply it to prove three Rogers--Ramanujan type identities of modulo 14 that were posed by Nandi through vertex operator theoretic construction of the level 4 standard modules of the affine Lie algebra $A^{(2)}_{2}$.
A generalization of a beautiful $q$-series identity found in the unorganized portion of Ramanujan's second and third notebooks is obtained. As a consequence, we derive a new three-parameter identity which is a rich source of partition-theoretic information. In particular, we use this identity to obtain a generalization of a recent result of Andrews, Garvan and Liang, which itself generalizes the famous result of Fokkink, Fokkink and Wang. This three-parameter identity also leads to several new weighted partition identities as well as a natural proof of a recent result of Garvan. This natural p…
