Formal residue and computer proofs of combinatorial identities

The coefficient of x^{-1} of a formal Laurent series f(x) is called the formal residue of f(x). Many combinatorial numbers can be represented by the formal residues of hypergeometric terms. With these representations and the extended Zeilberger's algorithm, we generate recurrence relations for summations involving combinatorial sequences such as Stirling numbers. As examples, we give computer proofs of several known identities and derive some new identities. The applicability of this method is also studied.Comment: 14 page

qq-Analogues of some series for powers of π\pi

We obtain $q$-analogues of several series for powers of $\pi$. For example, the identity $$\sum_{k=0}^\infty\frac{(-1)^k}{(2k+1)^3}=\frac{\pi^3}{32}$$ has the following $q$-analogue: \begin{equation*} \sum_{k=0}^\infty(-1)^k\frac{q^{2k}(1+q^{2k+1})}{(1-q^{2k+1})^3}=\frac{(q^2;q^4)_{\infty}^2(q^4;q^4)_{\infty}^6} {(q;q^2)_{\infty}^4}, \end{equation*} where $q$ is any complex number with $|q|<1$. We also give $q$-analogues of four new series for powers of $\pi$ found by the second author.Comment: 10 pages. Add Theorem 1.

An Algorithm for Deciding the Summability of Bivariate Rational Functions

Let $\Delta_x f(x,y)=f(x+1,y)-f(x,y)$ and $\Delta_y f(x,y)=f(x,y+1)-f(x,y)$ be the difference operators with respect to $x$ and $y$. A rational function $f(x,y)$ is called summable if there exist rational functions $g(x,y)$ and $h(x,y)$ such that $f(x,y)=\Delta_x g(x,y) + \Delta_y h(x,y)$. Recently, Chen and Singer presented a method for deciding whether a rational function is summable. To implement their method in the sense of algorithms, we need to solve two problems. The first is to determine the shift equivalence of two bivariate polynomials. We solve this problem by presenting an algorithm for computing the dispersion sets of any two bivariate polynomials. The second is to solve a univariate difference equation in an algebraically closed field. By considering the irreducible factorization of the denominator of $f(x,y)$ in a general field, we present a new criterion which requires only finding a rational solution of a bivariate difference equation. This goal can be achieved by deriving a universal denominator of the rational solutions and a degree bound on the numerator. Combining these two algorithms, we can decide the summability of a bivariate rational function.Comment: 18 page

Partial transpose of permutation matrices

The partial transpose of a block matrix M is the matrix obtained by transposing the blocks of M independently. We approach the notion of partial transpose from a combinatorial point of view. In this perspective, we solve some basic enumeration problems concerning the partial transpose of permutation matrices. More specifically, we count the number of permutations matrices which are equal to their partial transpose and the number of permutation matrices whose partial transpose is still a permutation. We solve these problems also when restricted to symmetric permutation matrices only.Comment: 13 page

On qq-analogues of some series for π\pi and π2\pi^2

We obtain a new $q$-analogue of the classical Leibniz series $\sum_{k=0}^\infty(-1)^k/(2k+1)=\pi/4$, namely \begin{equation*} \sum_{k=0}^\infty\frac{(-1)^kq^{k(k+3)/2}}{1-q^{2k+1}}=\frac{(q^2;q^2)_{\infty}(q^8;q^8)_{\infty}}{(q;q^2)_{\infty}(q^4;q^8)_{\infty}}, \end{equation*} where $q$ is a complex number with $|q|<1$. We also show that the Zeilberger-type series $\sum_{k=1}^\infty(3k-1)16^k/(k\binom{2k}k)^3=\pi^2/2$ has two $q$-analogues with $|q|<1$, one of which is $$\sum_{n=0}^\infty q^{n(n+1)/2} \frac {1-q^{3n+2}} {1-q} \cdot\frac{(q;q)_n^3 (-q;q)_n}{(q^3;q^2)_{n}^3} = (1-q)^2 \frac{(q^2;q^2)^4_\infty}{(q;q^2)^4_\infty}.$$Comment: 11 page

On monotonicity of some combinatorial sequences

We confirm Sun's conjecture that (\root{n+1}\of{F_{n+1}}/\root{n}\of{F_n})_{n\ge 4} is strictly decreasing to the limit 1, where $(F_n)_{n\ge0}$ is the Fibonacci sequence. We also prove that the sequence (\root{n+1}\of{D_{n+1}}/\root{n}\of{D_n})_{n\ge3} is strictly decreasing with limit $1$, where $D_n$ is the $n$-th derangement number. For $m$-th order harmonic numbers $H_n^{(m)}=\sum_{k=1}^n 1/k^m\ (n=1,2,3,\ldots)$, we show that$(\root{n+1}\of{H^{(m)}_{n+1}}/\root{n}\of{H^{(m)}_n})_{n\ge3}$ is strictly increasing.Comment: 10 page

Infinite Orders and Non-DD-finite Property of 33-Dimensional Lattice Walks

Recently, Bostan and his coauthors investigated lattice walks restricted to the non-negative octant $\mathbb{N}^3$. For the $35548$ non-trivial models with at most six steps, they found that many models associated to a group of order at least $200$ and conjectured these groups were in fact infinite groups. In this paper, we first confirm these conjectures and then consider the non-$D$-finite property of the generating function for some of these models.Comment: 15 Page

Automated Discovery and Proof of Congruence Theorems for Partial Sums of Combinatorial Sequences

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such a sequence by $a_k$, we obtain a general formula that determines the congruence class, modulo $p$, of the indefinite sum $\sum_{k=0}^{rp -1} a_k$, for {\it any} prime $p$, and any positive integer $r$, as a linear combination of sequences that satisfy linear recurrence (alias difference) equations with constant coefficients. This enables us (or rather, our computers) to automatically discover and prove congruence theorems for such partial sums. Moreover, we show that in many cases, the set of the residues is finite, regardless of the prime $p$.Comment: 11 page

Nonterminating Basic Hypergeometric Series and the qq-Zeilberger Algorithm

We present a systematic method for proving nonterminating basic hypergeometric identities. Assume that $k$ is the summation index. By setting a parameter $x$ to $xq^n$, we may find a recurrence relation of the summation by using the $q$-Zeilberger algorithm. This method applies to almost all nonterminating basic hypergeometric summation formulas in the book of Gasper and Rahman. Furthermore, by comparing the recursions and the limit values, we may verify many classical transformation formulas, including the Sears-Carlitz transformation, transformations of the very-well-poised $_8\phi_7$ series, the Rogers-Fine identity, and the limiting case of Watson's formula that implies the Rogers-Ramanujan identities.Comment: 30 page

An Iterated Map for the Lebesgue Identity

We present a simple iteration for the Lebesgue identity on partitions, which leads to a refinement involving the alternating sums of partitions.Comment: 4 pages, 2 figure