Related papers: The WZ method and flawless WZ pairs
We combine the powerful method of Wilf-Zeilberger pairs with systematic theory of multiple zeta values to prove a large number of series identities due to Z.W. Sun, many of them have been long standing conjectures.
We develop the notion of Wilf-Zeilberger seeds as a powerful framework for generating WZ-pairs and for lifting classical hypergeometric identities to the $q$-setting. As an application, we systematically obtain a large family of…
Using the WZ method to prove supercongruences critically depends on an inspired WZ pair choice. This paper demonstrates a procedure for finding WZ pair candidates to prove a given supercongruence. When suitable WZ pairs are thus obtained,…
In this paper we formulate combinatorial identities that give representation of positive integers as linear combination of even powers of 2 with binomial coefficients. We present side by side combinatorial as well as computer generated…
We use the Wilf-Zeilberger method to prove identities between Mahler measures of polynomials. In particular, we offer a new proof of a formula due to Lal\'{i}n, and we show how to translate the identity into a formula involving elliptic…
The known WZ-proofs for Ramanujan-type series related to $1/\pi$ gave us the insight to develop a new proof strategy based on the WZ-method. Using this approach we are able to find more generalizations and discover first WZ-proofs for…
Through a systematic approach on generating Wilf-Zeilberger-pairs, we prove some hypergeometric identities conjectures due to Z.W. Sun, J. Guillera and Y. Zhao etc., including two Ramanujan-$1/\pi^4$, one $1/\pi^3$ formulas as well as a…
Motivated by the telescoping proofs of two identities of Andrews and Warnaar, we find that infinite q-shifted factorials can be incorporated into the implementation of the q-Zeilberger algorithm in the approach of Chen, Hou and Mu to prove…
We propose a systematic method for constructing Wilf-Zeilberger (WZ) seeds and present seven WZ seeds. We also demonstrate how to construct WZ seeds from existing ones. With these WZ seeds, several hypergeometric identities are derived. The…
Wilf-Zeilberger pairs are fundamental in the algorithmic theory of Wilf and Zeilberger for computer-generated proofs of combinatorial identities. Wilf-Zeilberger forms are their high-dimensional generalizations, which can be used for…
Automating formal proofs of combinatorial identities is challenging for LLM-based provers, as long-horizon proof planning is required and unconstrained search quickly explodes. Symbolic methods such as the Wilf-Zeilberger (WZ) method can…
By using the Wilf-Zeilberger method, we prove a novel finite combinatorial identity related to a bivariate generating function for $\zeta(2+r+2s)$ (an extension of a Bailey-Borwein-Bradley Apery-like formula for even zeta values). Such…
In this paper we prove some Ramanujan-type formulas for $1/\pi$ but without using the theory of modular forms. Instead we use the WZ-method created by H. Wilf and D. Zeilberger and find some hypergeometric functions in two variables which…
In this paper, based on the WZ theory, a very succinct new proof, of an identity by Chaundy and Bullard, was given.
By extracting coefficients from Wilf-Zeilberger pairs with respect to auxiliary parameters, we discover many nontrivial hypergeometric series involving harmonic numbers. In particular, we obtain a rapidly convergent series for the depth-two…
We utilize the Wilf-Zeilberger (WZ) method to establish congruences related to truncated Ramanujan-type series. By constructing hypergeometric terms $f(k, a, b, \ldots)$ with Gosper-summable differences and selecting appropriate parameters,…
We use Zeilberger's algorithm for proving some identities of Ramanujan-type via $_2F_1$ evaluations.
We consider $AD$-type orbifolds of the triplet vertex algebras $\mathcal{W}(p)$ extending the well-known $c=1$ orbifolds of lattice vertex algebras. We study the structure of Zhu's algebras $A(\mathcal{W}(p)^{A_m})$ and…
Recently, Chen, Hou and Jin used both Abel's lemma on summation by parts and Zeilberger's algorithm to generate recurrence relations for definite summations. Meanwhile, they proposed the Abel-Gosper method to evaluate some indefinite sums…
We use both Abel's lemma on summation by parts and Zeilberger's algorithm to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case of linear difference operators with polynomial…