An Algorithm for Numerically Computing Preimages of the j-invariant Open Access

Alwaise, Ethan James (2017)

Permanent URL:


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(τ). We use recent work of Bringmann, Kane, Löbrich, Ono, and Rolen, which gives asymptotics for the Fourier coefficients of divisor modular forms, to identify the real and imaginary parts of the preimage.

Table of Contents

1. Introduction and Statement of Results

2. Preliminaries on Elliptic Curves over C

3. Determining Fundamental Periods from an Elliptic Curve over C

4. Modular Forms and Harmonic Maass Forms

5. Proof of Theorem 1.0.4

6. Examples

About this Master's Thesis

Rights statement
  • Permission granted by the author to include this thesis or dissertation in this repository. All rights reserved by the author. Please contact the author for information regarding the reproduction and use of this thesis or dissertation.
  • English
Research Field
Committee Chair / Thesis Advisor
Committee Members
Last modified

Primary PDF

Supplemental Files