Algorithms for Modular Parametrizations of Elliptic Curves over $\mathbb{Q}$
Abstract
Let be a complex elliptic curve with conductor and modular invariant . We construct a class of modular polynomials that relate the modular function on to the -invariant , where is obtained by composing the first coordinate function of with the modular parametrization . Using , we can precisely determine the poles of , compute exact values of at cusps, and develop an algorithm for calculating ramification points of . Moreover, yields an efficient algorithm for computing the fibres of over arbitrary points on . In some sense, also provides a ``total" formula for computing the minimal polynomial of the images of Heegner points on under . Especially, we compute the semi-trace of the image of the CM-point on , under the action of a 65-element subgroup of the 260-element Galois group of . Finally, we associate a point of infinite order in~ with an infinite sequence~ of algebraic numbers whose degrees are bounded by the degree of~. This provides one seemingly practicable approach to addressing the BSD conjecture.
Keywords
Cite
@article{arxiv.2509.14747,
title = {Algorithms for Modular Parametrizations of Elliptic Curves over $\mathbb{Q}$},
author = {SanMin Wang},
journal= {arXiv preprint arXiv:2509.14747},
year = {2025}
}