249 citations · 1.5k across the 98 of their papers we have counts for
Showing 2003Show all
3 papers · 1 filter
math.CA2003
On a combinatorial problem of Asmus Schmidt
Wadim Zudilin
For any integer , define a sequence of numbers , independent of the parameter , by $$ \sum_{k=0}^n{\binom nk}^r{\binom{n+k}k}^r =\sum_{k=0}^n\…
math.NT2003★ 5 cited
Well-poised generation of Apéry-like recursions
Wadim Zudilin
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…
math.NT2003★ 24 cited
Euler's constant, q-logarithms, and formulas of Ramanujan and Gosper
Jonathan Sondow, Wadim Zudilin
The aim of the paper is to relate computational and arithmetic questions about Euler's constant with properties of the values of the -logarithm function, with natural choice…