arXiv · 1708.02725
An Algorithm for Numerically Inverting the Modular $j$-function
Abstract
The modular $j$-function is a bijective map from $X_0(1) \setminus \{\infty\}$ to $\mathbb{C}$. A natural question is to describe the inverse map. Gauss offered a solution to the inverse problem in terms of the arithmetic-geometric mean. This method relies on an elliptic curve model and the Gaussian hypergeometric series. Here we use the theory of polar harmonic Maass forms to solve the inverse problem by directly examining the Fourier expansion of the weight $2$ polar harmonic Maass form obtained by specializing the logarithmic derivative of the denominator formula for the Monster Lie algebra.
Explore related subjects
Keep this discovery
Ethan Alwaise. 2017-08-09. An Algorithm for Numerically Inverting the Modular $j$-function. https://arxiv.org/abs/1708.02725
Cite the original work for its findings. Save a collection to share your selection of sources.