English

Algorithms for Modular Parametrizations of Elliptic Curves over $\mathbb{Q}$

Number Theory 2025-09-19 v1

Abstract

Let E E be a complex elliptic curve with conductor N N and modular invariant j(E)Q j(E) \in \mathbb{Q} . We construct a class of modular polynomials FN(x,j)F_N(x,j) that relate the modular function xx on X0(N)X_0(N) to the jj-invariant jj, where xx is obtained by composing the first coordinate function of EE with the modular parametrization φ:X0(N)E\varphi: X_0(N) \rightarrow E. Using FN(x,j)F_N(x,j), we can precisely determine the poles of φ\varphi, compute exact values of φ\varphi at cusps, and develop an algorithm for calculating ramification points of φ\varphi. Moreover, FN(x,j)F_N(x,j) yields an efficient algorithm for computing the fibres of φ\varphi over arbitrary points on EE. In some sense, FN(x,j)F_N(x,j) also provides a ``total" formula for computing the minimal polynomial of the images of Heegner points on X0(N)X_0(N) under φ\varphi. Especially, we compute the semi-trace of the image φ([1+32])\varphi ([\frac{{ - 1 + \sqrt { - 3} }}{2}]) of the CM-point [1+32][\frac{-1 + \sqrt{-3}}{2}] on X0(389)X_{0}(389), under the action of a 65-element subgroup of the 260-element Galois group of Q(3,j(3891+32))\mathbb{Q}(\sqrt{-3}, j(389 \cdot \frac{-1 + \sqrt{-3}}{2})). Finally, we associate a point of infinite order in~E(Q) E(\mathbb{Q}) with an infinite sequence~{(j(τn),j(Nτn))}nZ+\{ (j(\tau_n), j(N\tau_n)) \}_{n \in \mathbb{Z}^+} of algebraic numbers whose degrees are bounded by the degree of~φ\varphi. 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}
}
R2 v1 2026-07-01T05:43:24.502Z