The generalized Borwein conjecture. I. The Burge transform

In this paper we prove some new series for $1/\pi$ as well as related congruences. We also raise several new kinds of series for $1/\pi$ and present some related conjectural congruences involving representations of primes by binary quadratic forms.

We propose a heuristic algorithm for fast computation of the Poincar\'{e} series $P_n(t)$ of the invariants of binary forms of degree $n$, viewed as rational functions. The algorithm is based on certain polynomial identities which remain to be proved rigorously. By using it, we have computed the $P_n(t)$ for $n\le30$.

A generalized central trinomial coefficient $T_n(b,c)$ is the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$ with $b,c\in\mathbb Z$. In this paper we investigate congruences and series for sums of terms related to central binomial coefficients and generalized central trinomial coefficients. The paper contains many conjectures on congruences related to representations of primes by certain binary quadratic forms, and 62 proposed new series for $1/\pi$ motivated by cong...

In a recent paper, Griffin, Ono and Warnaar present a framework for Rogers-Ramanujan type identities using Hall-Littlewood polynomials to arrive at expressions of the form \[\sum_{\lambda : \lambda_1 \leq m} q^{a|\lambda|}P_{2\lambda}(1,q,q^2,\ldots ; q^{n}) = \text{"Infinite product modular function"}\] for $a = 1,2$ and any positive integers $m$ and $n$. A recent paper of Rains and Warnaar presents further Rogers-Ramanujan type identities involving sums of terms $q^{|\lambd...

We show that the Bailey lattice can be extended to a bilateral version in just a few lines from the bilateral Bailey lemma, using a very simple lemma transforming bilateral Bailey pairs related to $a$ into bilateral Bailey pairs related to $a/q$. Using this lemma and similar ones, we give bilateral versions and simple proofs of other (new and known) Bailey lattices, among which a Bailey lattice of Warnaar and the inverses of Bailey lattices of Lovejoy. As consequences of our ...

In a recent paper, I defined the "standard multiparameter Bailey pair" (SMPBP) and demonstrated that all of the classical Bailey pairs considered by W.N. Bailey in his famous paper (\textit{Proc. London Math. Soc. (2)}, \textbf{50} (1948), 1--10) arose as special cases of the SMPBP. Additionally, I was able to find a number of new Rogers-Ramanujan type identities. From a given Bailey pair, normally only one or two Rogers-Ramanujan type identities follow immediately. In this p...

Our object is a thorough analysis of the WP-Bailey tree, a recent extension of classical Bailey chains. We begin by observing how the WP-Bailey tree naturally entails a finite number of classical q-hypergeometric transformation formulas. We then show how to move beyond this closed set of results and in the process we explicate heretofore mysterious identities of D. Bressoud. Next, we use WP-Bailey pairs to provide a new proof of recent formula of A. Kirillov. Finally, we disc...

Bressoud introduced the partition function $B(\alpha_1,\ldots,\alpha_\lambda;\eta,k,r;n)$, which counts the number of partitions with certain difference conditions. Bressoud posed a conjecture on the generating function for the partition function $B(\alpha_1,\ldots,\alpha_\lambda;\eta,k,r;n)$ in multi-summation form. In this article, we introduce a bijection related to Bressoud's conjecture. As an application, we give a new companion to the G\"ollnitz-Gordon identities.

A conjecture of Borwein asserts that for any positive integers $n$ and $k$, the coefficient $a_{3k}$ of $q^{3k}$ in the expansion of $\prod_{j=0}^n (1-q^{3j+1})(1-q^{3j+2})$ is nonnegative. In this paper we prove that for any $0 \leq k\leq n$, there is a constant $0<c<1$ such that $$a_{3k}+a_{3(n+1)+3k}+\cdots+a_{3n(n+1)+3k}=\frac {2\cdot 3^{n}} {n+1}(1+O(c^n)).$$ In particular, $$a_{3k}+a_{3(n+1)+3k}+\cdots+a_{3n(n+1)+3k}>0.$$

The purpose of the paper is to introduce two new algorithms. The first one computes a linear recursion for proper hypergeometric multisums, by treating one summation variable at a time, and provides rational certificates along the way. A key part in the search of a linear recursion is an improved universal denominator algorithm that constructs all rational solutions $x(n)$ of the equation $$ \frac{a_m(n)}{b_m(n)}x(n+m)+...+\frac{a_0(n)}{b_0(n)}x(n)= c(n),$$ where $a_i(n), b_i...