English

An Algorithm for Numerically Inverting the Modular $j$-function

Number Theory 2017-08-10 v1

Abstract

The modular jj-function is a bijective map from X0(1){}X_0(1) \setminus \{\infty\} to C\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 22 polar harmonic Maass form obtained by specializing the logarithmic derivative of the denominator formula for the Monster Lie algebra.

Keywords

Cite

@article{arxiv.1708.02725,
  title  = {An Algorithm for Numerically Inverting the Modular $j$-function},
  author = {Ethan Alwaise},
  journal= {arXiv preprint arXiv:1708.02725},
  year   = {2017}
}