Well-poised generation of Apéry-like recursions
Wadim Zudilin
Abstract
The idea to use classical hypergeometric series and, in particular, well-poised hypergeometric series in diophantine problems of the values of the polylogarithms has led to several novelties in number theory and neighbouring areas of mathematics. Here we present a systematic approach to derive second-order polynomial recursions for approximations to some values of the Lerch zeta function, depending on the fixed (but not necessarily real) parameter α satisfying the condition (α)<1. Substituting α=0 into the resulting recurrence equations produces the famous recursions for rational approximations to ζ(2), ζ(3) due to Apéry, as well as the known recursion for rational approximations to ζ(4). Multiple integral representations for solutions of the constructed recurrences are also given.
Create a lesson
Related papers
Unit fraction representations using shifted Golomb primes
Rishika Agrawal
Improved deterministic integer factorization by quadratic-image sieving
Pantelimon Stănică
Private key sieves for improved attacks on RSA
Markus Hittmeir
Multiple q-zeta values as polynomials in partition multiplicities
Jan-Willem M. van Ittersum
Hopf-Galois Structures on Extensions Arising from Division Points on Elliptic Curves
Leolin Nkuete
Certified Collision Exclusion and an Unconditional Upper Bound Λ<0.156821 for the de Bruijn--Newman Constant
Michel Planat, Dale James Raymond