Algorithms for Modular Parametrizations of Elliptic Curves over Q
Abstract
Let \( E \) be a complex elliptic curve with conductor \( N \) and modular invariant \( j(E) ∈ Q \). We construct a class of modular polynomials FN(x,j) that relate the modular function x on X0(N) to the j-invariant j, where x is obtained by composing the first coordinate function of E with the modular parametrization : X0(N) → E. Using FN(x,j), we can precisely determine the poles of , compute exact values of at cusps, and develop an algorithm for calculating ramification points of . Moreover, FN(x,j) yields an efficient algorithm for computing the fibres of over arbitrary points on E. In some sense, FN(x,j) also provides a ``total" formula for computing the minimal polynomial of the images of Heegner points on X0(N) under . Especially, we compute the semi-trace of the image ([ - 1 + - 3 2]) of the CM-point [-1 + -32] on X0(389), under the action of a 65-element subgroup of the 260-element Galois group of Q(-3, j(389 · -1 + -32)). Finally, we associate a point of infinite order in~\( E(Q) \) with an infinite sequence~\ (j(τn), j(Nτn)) \n ∈ Z+ of algebraic numbers whose degrees are bounded by the degree of~. This provides one seemingly practicable approach to addressing the BSD conjecture.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.