Crouching AGM, hidden modularity

From MaRDI portal




Abstract: Special arithmetic series f(x)=sumn=0inftycnxn, whose coefficients cn are normally given as certain binomial sums, satisfy "self-replicating" functional identities. For example, the equation frac1{(1+4z)^2}f�iggl(frac{z}{(1+4z)^3}�iggr)=frac1{(1+2z)^2}f�iggl(frac{z^2}{(1+2z)^3}�iggr) generates a modular form f(x) of weight 2 and level 7, when a related modular parametrization x=x(au) is properly chosen. In this note we investigate the potential of describing modular forms by such self-replicating equations as well as applications of the equations that do not make use of the modularity. In particular, we outline a new recipe of generating AGM-type algorithms for computing pi and other related constants. Finally, we indicate some possibilities to extend the functional equations to a two-variable setting.











This page was built for publication: Crouching AGM, hidden modularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5377713)