Search arXivSearch

arXiv · 2602.14314

The construction of $q$-analogues via $_3ϕ_2$-series and $q$-difference equations

Abstract

We apply the EKHAD-normalization method given in our recent work to obtain, via the $q$-version of Zeilberger's algorithm, $q$-WZ pairs $(F, G)$ such that $\sum_{k = 0}^{\infty} F(0, k)$ may be expressed as a basic hypergeometric series of the form ${}_{3}ϕ_2$ with multiple free parameters, and in such a way so that $\sum_{k=0}^{\infty} F(0, k) = \sum_{n=0}^{\infty} G(n, 0)$. In contrast to how previous applications of EKHAD-normalization relied on $q$-analogues for specific WZ pairs introduced by Guillera, our multiparameter approach provides a broad framework in the construction of $q$-analogues for accelerated series for universal constants such as $π$. We apply this multiparameter version of EKHAD-normalization to obtain and prove new $q$-analogues for accelerated hypergeometric series attributed to many authors, including (alphabetically) Adamchik and Wagon, Apéry, Chu, Chu and Zhang, Fabry, Guillera, Ramanujan, and Zeilberger.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John M. Campbell. 2026-02-15. The construction of $q$-analogues via $_3ϕ_2$-series and $q$-difference equations. https://arxiv.org/abs/2602.14314

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO