|Title: An Algorithm for Numerically Computing Preimages of the $j$-invariant|
|Speaker: Ethan Alwaise of Emory University|
|Contact: Ethan Alwaise, firstname.lastname@example.org|
|Date: 2017-04-05 at 5:30PM|
Here we explore the problem of numerically computing preimages of the $j$-invariant. We present an algorithm based on studying the asymptotics of the Fourier coefficients of the logarithmic derivative of $j(\tau)$. We use recent work of Bringmann et al., which gives asymptotics for the Fourier coefficients of divisor modular forms, to identify the real and imaginary parts of the preimage.
See All Seminars