Occasion: Challenges in 21st Century Experimental Mathematical Computation
Place: ICERM, Brown University
AbstractThe Apéry numbers are the famous sequence which underlies Apéry's proof of the irrationality of \(\zeta(3)\). Following a question of Beukers, a computer search of Zagier has revealed a finite collection of related sequences which occur as integral solutions of Apéry-like recurrence equations. This search has since been extended to more general recurrence equations, and in each case only finitely many sequences appear to exist. Among the remarkable properties of these sequences are connections with modular forms and so-called supercongruences, some of which remain conjectural. We review these properties and demonstrate how Apéry-like numbers and their connection with modular forms feature in various, apparently unrelated, problems, such as the theory of short random walks or the computation of digits of \(\pi\).
|2014aperylike-icerm.pdf||726.90 KB||Slides (PDF, 42 pages)||876|