Search arXivSearch

arXiv · 1901.04841

Lifting Bailey Pairs to WP-Bailey Pairs

Abstract

A pair of sequences $(α_{n}(a,k,q),β_{n}(a,k,q))$ such that $α_0(a,k,q)=1$ and \[ β_{n}(a,k,q) = \sum_{j=0}^{n} \frac{(k/a; q)_{n-j}(k; q)_{n+j}}{(q;q)_{n-j}(aq;q)_{n+j}}α_{j}(a,k,q) \] is termed a \emph{WP-Bailey Pair}. Upon setting $k=0$ in such a pair we obtain a \emph{Bailey pair}. In the present paper we consider the problem of "lifting" a Bailey pair to a WP-Bailey pair, and use some of the new WP-Bailey pairs found in this way to derive some new identities between basic hypergeometric series and new single sum- and double sum identities of the Rogers-Ramanujan-Slater type.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

James Mc Laughlin, Andrew V. Sills, Peter Zimmer. 2019-01-04. Lifting Bailey Pairs to WP-Bailey Pairs. https://doi.org/10.1016/j.disc.2009.03.015

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT