We consider an identity relating Fibonacci numbers to Pascal's triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, most of them rather involved or else relying on sophisticated number theoretical arguments. We present a new proof, quite simple and based on a Riordan array argument. The main point of the proof is the construction of a new Riordan array from a given Riordan array, by the elimination of elements. We extend the method and as an application we obtain other identities, some of which are new. An important feature of our construction is that it establishes a nice connection between the generating function of the $A-$sequence of a certain class of Riordan arrays and hypergeometric functions.
For an integer $p\geq 2$ we construct vertical and horizontal one-pth Riordan arrays from a Riordan array. When $p=2$, one-pth Riordan arrays reduced to well known half Riordan arrays. The generating functions of the $A$-sequences of vertical and horizontal one-pth Riordan arrays are found. The vertical and horizontal one-pth Riordan arrays provide an approach to construct many identities. They can also be used to verify some well known identities readily.
We construct Andrews-Gordon type evidently positive series as generating functions for the partitions satisfying the difference conditions imposed by Capparelli's identities and Göllnitz-Gordon identities. The construction involves building base partitions, and move parts around subject to certain rules. Some missing cases are also considered, but no new identities are given.
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.
Recently, Andrews and Merca have given a new combinatorial interpretation of the total number of even parts in all partitions of n into distinct parts. We generalise this result and consider many more variations of their work. We also highlight some connections with the work of Fu and Tang.
In this paper, by the method of comparing coefficients and the inverse technique, we establish the corresponding variate forms of two identities of Andrews and Yee for mock theta functions, as well as a few allied but unusual $q$-series identities. Among includes a new Bailey pair from which a product formula of two ${}_2ϕ_1$ series is derived. Further, we focus on two finite $q$-series summations arising from Andrews and Yee's mock theta function identities and expound some recurrence relations and transformation formulas behind them.
In this paper we set up a bivariate representation of partial theta functions which not only unifies some famous identities for partial theta functions due to Andrews and Warnaar, et al. but also unveils a new characteristic of such identities. As further applications, we establish a general form of Warnaar's identity and a general $q$--series transformation associated with Bailey pairs via the use of the power series expansion of partial theta functions.
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 which are satisfied by the generating functions. In contrast, the conventional approach is to show that a variant of well-known series satisfies the system of functional equations, thus reconciling two separate lines of computations.
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.
The Göllnitz-Gordon identities were found by Göllnitz and Gordon independently. In 1967, Andrews obtained a combinatorial generalization of the Göllnitz-Gordon identities, called the Andrews-Göllnitz-Gordon theorem. In 1980, Bressoud extended the Andrews-Göllnitz-Gordon theorem to even moduli, called the Bressoud-Göllnitz-Gordon theorem. Furthermore, Bressoud gave the generating functions for the generalizations of the Göllnitz-Gordon identities. In this article, we will give new companions to the generalizations of the Göllnitz-Gordon identities.
A multilateral Bailey Lemma is proved, and multiple analogues of the Rogers--Ramanujan identities and Euler's Pentagonal Theorem are constructed as applications. The extreme cases of the Andrews--Gordon identities are also generalized using the multilateral Bailey Lemma where their final form is written in terms of determinants of theta functions.
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.
According to the method of series rearrangement, we establish two generalizations of Andrews' curious $q$-series identity with an extra integer parameter. The limiting cases of them produce two extensions of Andrews' curious $_3F_2(\frac{3}{4})$-series identity with an additional integer parameter. Meanwhile, several related results are also given.
In this paper, we study symmetric lattice paths. Let $d_{n}$, $m_{n}$, and $s_{n}$ denote the number of symmetric Dyck paths, symmetric Motzkin paths, and symmetric Schröder paths of length $2n$, respectively. By using Riordan group methods we obtain six identities relating $d_{n}$, $m_{n}$, and $s_{n}$ and also give two of them combinatorial proofs. Finally, we investigate some relations satisfied by the generic element of some special Riordan arrays and get the average mid-height and the average number of points on the x-axis of symmetric Dyck paths of length $2n.$
We prove a constant term conjecture of Robbins and Zeilberger (J. Combin. Theory Ser. A 66 (1994), 17-27), by translating the problem into a determinant evaluation problem and evaluating the determinant. This determinant generalizes the determinant that gives the number of all totally symmetric self-complementary plane partitions contained in a $(2n)\times(2n)\times(2n)$ box and that was used by Andrews (J. Combin. Theory Ser. A 66 (1994), 28-39) and Andrews and Burge (Pacific J. Math. 158 (1993), 1-14) to compute this number explicitly. The evaluation of the generalized determinant is indepen…
We present a dual of a family of partition identities of Andrews involving partitions with no repeated odd parts (among other conditions), along with an overpartition generalization that encapsulates both families. These were discovered during the course of research for an upcoming article by the authors along with Debajyoti Nandi. The proof uses Appell's comparison theorem.
The two partition functions $p_ω(n)$ and $p_ν(n)$ were introduced by Andrews, Dixit and Yee, which are related to the third order mock theta functions $ω(q)$ and $ν(q)$, respectively. Recently, Andrews and Yee analytically studied two identities that connect the refinements of $p_ω(n)$ and $p_ν(n)$ with the generalized bivariate mock theta functions $ω(z;q)$ and $ν(z;q)$, respectively. However, they stated these identities cried out for bijective proofs. In this paper, we first define the generalized trivariate mock theta functions $ω(y,z;q)$ and $ν(y,z;q)$. Then by utilizing odd Ferrers graph…
A few years ago Foda, Quano, Kirillov and Warnaar proposed and proved various finite analogs of the celebrated Andrews-Gordon identities. In this paper we use these polynomial identities along with the combinatorial techniques introduced in our recent paper to derive Garrett, Ismail, Stanton type formulas for two variants of the Andrews-Gordon identities.
The object of this paper is to propose and prove a new generalization of the Andrews-Gordon identities, extending a recent result of Garrett, Ismail and Stanton. We also give a combinatorial discussion of the finite form of their result, which appeared in the work of Andrews, Knopfmacher, and Paule.
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…
We present what we call a "motivated proof" of the Göllnitz-Gordon-Andrews identities. A similar motivated proof of the Rogers-Ramanujan identities was previously given by G. E. Andrews and R. J. Baxter, and was subsequently generalized to Gordon's identities by J. Lepowsky and M. Zhu. We anticipate that the present proof of the Göllnitz-Gordon-Andrews identities will illuminate certain twisted vertex-algebraic constructions.
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…
Recently, Andrews and Yee studied two-variable generalizations of two identities involving partition functions $p_ω(n)$ and $p_ν(n)$ introduced by Andrews, Dixit and Yee. In this paper, we present a combinatorial proof of an interesting identity in their work.
In this article we extend a theorem of Andrews, Crippa, and Simon on the asymptotic behavior of polynomials defined by a general class of recursive equations. Here the polynomials are in the variable $q$, and the recursive definition at step $n$ introduces a polynomial in $n$. Our extension replaces the polynomial in $n$ with either an exponential or periodic function of $n$.
A vertical recursive relation approach to Riordan arrays is induced, while the horizontal recursive relation is represented by $A$- and $Z$-sequences. This vertical recursive approach gives a way to represent the entries of a Riordan array $(g,f)$ in terms of a recursive linear combinations of the coefficients of $g$. A matrix representation of the vertical recursive relation is also given. The set of all those matrices forms a group, called the quasi-Riordan group. The extensions of the horizontal recursive relation and the vertical recursive relation in terms of $c$- and $C$- Riordan arrays …
We use the classical umbral calculus to describe Riordan arrays. Here, a Riordan array is generated by a pair of umbrae, and this provides efficient proofs of several basic results of the theory such as the multiplication rule, the recursive properties, the fundamental theorem and the connection with Sheffer sequences. In particular, we show that the fundamental theorem turns out to be a reformulation of the umbral Abel identity. As an application, we give an elementary approach to the problem of extending integer powers of Riordan arrays to complex powers in such a way that additivity of the …
The restricted partitions in which the largest part is less than or equal to $N$ and the number of parts is less than or equal to $k$ were investigated by Andrews in \cite{Andrews76}. These partitions were extended recently by the author to the partitions into parts of two kinds. In this paper, we use a new class of restricted partitions into parts of two kinds to provide new combinatorial interpretations for two identities of Guo and Yang.
We construct Andrews-Gordon type evidently positive series as generating functions of partitions satisfying certain difference conditions in six conjectures by Kanade and Russell. We construct generating functions for missing partition enumerants, naturally without claiming new partition identities. Thus, we obtain $q$-series conjectures as companions to Kanade and Russell's combinatorial conjectures.
We give a proof of a recent combinatorial conjecture due to the first author, which was discovered in the framework of commutative algebra. This result gives rise to new companions to the famous Andrews-Gordon identities. Our tools involve graded quotient rings, Durfee squares and rectangles for integer partitions, and $q$-series identities.
George Andrews and Ae Ja Yee recently established beautiful results involving bivariate generalizations of the third order mock theta functions $ω(q)$ and $ν(q)$, thereby extending their earlier results with the second author. Generalizing the Andrews-Yee identities for trivariate generalizations of these mock theta functions remained a mystery, as pointed out by Li and Yang in their recent work. We partially solve this problem and generalize these identities. Several new as well as well-known results are derived. For example, one of our two main theorems gives, as a corollary, a special case …
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…
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.
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…
This paper studies Zeilberger's two prized constant term identities. For one of the identities, Zeilberger asked for a simple proof that may give rise to a simple proof of Andrews theorem for the number of totally symmetric self complementary plane partitions. We obtain an identity reducing a constant term in $2k$ variables to a constant term in $k$ variables. As applications, Zeilberger's constant terms are converted to single determinants. The result extends for two classes of matrices, the sum of all of whose full rank minors is converted to a single determinant. One of the prized constant …
We present what we call a "motivated proof" of the Andrews-Bressoud partition identities for even moduli. A "motivated proof" of the Rogers-Ramanujan identities was given by G. E. Andrews and R. J. Baxter, and this proof was generalized to the odd-moduli case of Gordon's identities by J. Lepowsky and M. Zhu. Recently, a "motivated proof" of the somewhat analogous Göllnitz-Gordon-Andrews identities has been found. In the present work, we introduce "shelves" of formal series incorporating what we call "ghost series," which allow us to pass from one shelf to the next via natural recursions, leadi…
In this paper, by applying a range of classic summation and transformation formulas for basic hypergeometric series, we obtain a three-term identity for partial theta functions. It extends the Andrews-Warnaar partial theta function identity, and also unifies several results on partial theta functions due to Ramanujan, Lovejoy and Kim. We also establish a two-term version of the extension, which can be used to derive identities for partial and false theta functions. Finally, we present a relation between the big $q$-Jacobi polynomials and the Andrews-Warnaar partial theta function identity.
By applying the derivative operator to the corresponding hypergeometric form of a $q$-series transformation due to Andrews [1,Theorem 4], we establish a general harmonic number identity. As the special cases of it, several interesting Chu-Donno type identities and Paule-Schneider type identities are displayed.
A partial Motzkin path is a path from $(0, 0)$ to $(n, k)$ in the $XOY$-plane that does not go below the $X$-axis and consists of up steps $U=(1, 1)$, down steps $D=(1, -1)$ and horizontal steps $H=(1, 0)$. A weighted partial Motzkin path is a partial Motzkin path with the weight assignment that all up steps and down steps are weighted by 1, the horizontal steps are endowed with a weight $x$ if they are lying on $X$-axis, and endowed with a weight $y$ if they are not lying on $X$-axis. Denote by $M_{n,k}(x, y)$ to be the weight function of all weighted partial Motzkin paths from $(0, 0)$ to $(…
We present a parametric family of Riordan arrays which are obtained by multiplying any Riordan array with a generalized Pascal array. In particular, we focus on some interesting properties of one-parameter Catalan triangles. We obtain several combinatorial identities that involve two special Catalan matrices, the Chebyshev polynomials of the second kind, some periodic sequences, and the Fibonacci numbers.
Recently, Wang and Ma propose a conjecture associated with the possible generalization of Andrews-Warnaar identities. It is confirmed in this paper. As the applications of this conjecture, we prove that a family of series can be expressed by the partial theta functions and construct some new partial theta function identities.
We study the Andrews-Schilling-Warnaar sum-sides for the principal characters of standard (i.e., integrable, highest weight) modules of $\mathrm{A}_2^{(1)}$. These characters have been studied recently by various subsets of Corteel, Dousse, Foda, Uncu, Warnaar and Welsh. We prove complete sets of identities for moduli $5$ through $8$ and $10$, in Andrews-Schilling-Warnaar form. The cases of moduli $6$ and $10$ are new. Our methods depend on the Corteel-Welsh recursions governing the cylindric partitions and on certain relations satisfied by the Andrews-Schilling-Warnaar sum-sides. We speculate…
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.
I revisit an automated proof of Andrews' pentagonal number theorem found by Riese. I uncover a simple polynomial identity hidden behind his proof. I explain how to use this identity to prove Andrews' result along with a variety of new formulas of similar type. I reveal an interesting relation between the tri-pentagonal theorem and items (19), (20), (94), (98) on the celebrated Slater list. Finally, I establish a new infinite family of multiple series identities.
