Computing the degree of a modular parametrization

  • J. E. Cremona
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 877)


The Weil-Taniyama conjecture states that every elliptic curve E/ℚ of conductor N can be parametrized by modular functions for the congruence subgroup Γ0(N) of the modular group Γ = PSL(2, ℤ). Equivalently, there is a non-constant map ϕ from the modular curve X0(N) to E. We present here a method of computing the degree of such a map ϕ for arbitrary N. Our method, which works for all subgroups of finite index in Γ and not just Γ0(N), is derived from a method of Zagier in [2]; by using those ideas, together with techniques which have been used by the author to compute large tables of modular elliptic curves (see [1]), we are able to derive an explicit and general formula which is simpler to implement than Zagier's. We discuss the results obtained, including several examples.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. E. Cremona, Algorithms for Modular Elliptic Curves, Cambridge University Press, 1992.Google Scholar
  2. 2.
    D. Zagier, Modular Parametrizations of Elliptic Curves, Canadian. Math. Bull. (1985) 28, 372–384.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • J. E. Cremona
    • 1
  1. 1.University of ExeterEngland

Personalised recommendations