arXiv subjects
Publications and source records attributed to Victor J. W. Guo.
We present two general finite extensions for each of the two Rogers-Ramanujan identities. Of these one can be derived directly from Watson's transformation formula by specialization or through Bailey's method, the second similar formula can be proved either by using the first formula and the q-Gosper algorithm, or through the so-called Bailey lattice.
Generalizing a classical problem in enumerative combinatorics, Mansour and Sun counted the number of subsets of $\Z_n$ without certain separations. Chen, Wang, and Zhang then studied the problem of partitioning $\Z_n$ into arithmetical progressions of a given type under some technical conditions. In this paper, we improve on their main theorems by applying a convolution formula for cyclic multinomial coefficients due to Raney-Mohanty.
We give a new proof of a theorem of Mansour and Sun by using number theory and Rothe's identity.
Motivated by the resemblance of a multivariate series identity and a finite analogue of Euler's pentagonal number theorem, we study multiple extensions of the latter formula. In a different direction we derive a common extension of this multivariate series identity and two formulas of Lucas. Finally we give a combinatorial proof of Lucas' formulas.
In this paper we study the factors of some alternating sums of products of binomial and q-binomial coefficients. We prove that for all positive integers n_1,...,n_m, n_{m+1}=n_1, and 0\leq j\leq m-1, {n_1+n_{m}\brack n_1}^{-1}\sum_{k=-n_1}^{n_1}(-1)^kq^{jk^2+{k\choose 2}} \prod_{i=1}^m {n_i+n_{i+1}\brack n_i+k}\in \N[q], which generalizes a result of Calkin [Acta Arith. 86 (1998), 17--26]. Moreover, we show that for all positive integers n, r and j, {2n\brack n}^{-1}{2j\brack j} \sum_{k=j}^n(-1)^{n-k}q^{A}\frac{1-q^{2k+1}}{1-q^{n+k+1}} {2n\brack n-k}{k+j\brack k-j}^r\in N[q], where A=(r-1){n\choose 2}+r{j+1\choose 2}+{k\choose 2}-rjk, which solves a problem raised by Zudilin [Electron. J. Combin. 11 (2004), #R22].
For m>n\geq 0 and 1\leq d\leq m, it is shown that the q-Euler number E_{2m}(q) is congruent to q^{m-n}E_{2n}(q) mod (1+q^d) if and only if m\equiv n mod d. The q-Salié number S_{2n}(q) is shown to be divisible by (1+q^{2r+1})^{\left\lfloor \frac{n}{2r+1}\right\rfloor} for any r\geq 0. Furthermore, similar congruences for the generalized q-Euler numbers are also obtained, and some conjectures are formulated.
We deduce new q-series identities by applying inverse relations to certain identities for basic hypergeometric series. The identities obtained themselves do not belong to the hierarchy of basic hypergeometric series. We extend two of our identities, by analytic continuation, to bilateral summation formulae which contain Ramanujan's 1-psi-1 summation and a very-well-poised 4-psi-6 summation as special cases.
We show that several terminating summation and transformation formulas for basic hypergeometric series can be proved in a straightforward way. Along the same line, new finite forms of Jacobi's triple product identity and Watson's quintuple product identity are also proved.
Generalizing a sequence of Lambert, Cayley and Ramanujan, Chapoton has recently introduced a polynomial sequence Q_n:=Q_n(x,y,z,t) defined by Q_1=1, Q_{n+1}=[x+nz+(y+t)(n+y\partial_y)]Q_n. In this paper we prove Chapoton's conjecture on the duality formula: Q_n(x,y,z,t)=Q_n(x+nz+nt,y,-t,-z), and answer his question about the combinatorial interpretation of Q_n. Actually we give combinatorial interpretations of these polynomials in terms of plane trees, half-mobile trees, and forests of plane trees. Our approach also leads to a general formula that unifies several known results for enumerating trees and plane trees.
Let I_{n,k} (resp. J_{n,k}) be the number of involutions (resp. fixed-point free involutions) of {1,...,n} with k descents. Motivated by Brenti's conjecture which states that the sequence I_{n,0}, I_{n,1},..., I_{n,n-1} is log-concave, we prove that the two sequences I_{n,k} and J_{2n,k} are unimodal in k, for all n. Furthermore, we conjecture that there are nonnegative integers a_{n,k} such that $$ \sum_{k=0}^{n-1}I_{n,k}t^k=\sum_{k=0}^{\lfloor (n-1)/2\rfloor}a_{n,k}t^{k}(1+t)^{n-2k-1}. $$ This statement is stronger than the unimodality of I_{n,k} but is also interesting in its own right.
Let $$ S_{m,n}(q):=\sum_{k=1}^{n}\frac{1-q^{2k}}{1-q^2} (\frac{1-q^k}{1-q})^{m-1}q^{\frac{m+1}{2}(n-k)}. $$ Generalizing the formulas of Warnaar and Schlosser, we prove that there exist polynomials $P_{m,k}(q)\in\mathbb{Z}[q]$ such that $$ S_{2m+1,n}(q) =\sum_{k=0}^{m}(-1)^kP_{m,k}(q) \frac{(1-q^n)^{m+1-k}(1-q^{n+1})^{m+1-k}q^{kn}} {(1-q^2)(1-q)^{2m-3k}\prod_{i=0}^{k}(1-q^{m+1-i})}, $$ and solve a problem raised by Schlosser. We also show that there is a similar formula for the following $q$-analogue of alternating sums of powers: $$ T_{m,n}(q):=\sum_{k=1}^{n}(-1)^{n-k} (\frac{1-q^k}{1-q})^{m}q^{\frac{m}{2}(n-k)}. $$
Recently, Guo and Zeng discovered two families of polynomials featuring in a q-analogue of Faulhaber's formula for the sums of powers and a q-analogue of Gessel-Viennot's formula involving Salie's coefficients for the alternating sums of powers. In this paper, we show that these are polynomials with symmetric, nonnegative integral coefficients by refining Gessel-Viennot's combinatorial interpretations.
Motivated by some binomial coefficients identities encountered in our approach to the enumeration of convex polyominoes, we prove some more general identities of the same type, one of which turns out to be related to a strange evaluation of ${}_3F_2$ of Gessel and Stanton.
Lin and Chang gave a generating function of convex polyominoes with an $m+1$ by $n+1$ minimal bounding rectangle. Gessel showed that their result implies that the number of such polyominoes is $$ \frac{m+n+mn}{m+n}{2m+2n\choose 2m}-\frac{2mn}{m+n}{m+n\choose m}^2. $$ We show that this result can be derived from some binomial coefficients identities related to the generating function of Jacobi polynomials.
The Ramanujan polynomials were introduced by Ramanujan in his study of power series inversions. In an approach to the Cayley formula on the number of trees, Shor discovers a refined recurrence relation in terms of the number of improper edges, without realizing the connection to the Ramanujan polynomials. On the other hand, Dumont and Ramamonjisoa independently take the grammatical approach to a sequence associated with the Ramanujan polynomials and have reached the same conclusion as Shor's. It was a coincidence for Zeng to realize that the Shor polynomials turn out to be the Ramanujan polynomials through an explicit substitution of parameters. Shor also discovers a recursion of Ramanujan polynomials which is equivalent to the Berndt-Evans-Wilson recursion under the substitution of Zeng, and asks for a combinatorial interpretation. The objective of this paper is to present a bijection for the Shor recursion, or and Berndt-Evans-Wilson recursion, answering the question of Shor. Such a bijection also leads to a combinatorial interpretation of the recurrence relation originally given by Ramanujan.