Abstract
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 X 0 (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.
Preview
Unable to display preview. Download preview PDF.
References
J. E. Cremona, Algorithms for Modular Elliptic Curves, Cambridge University Press, 1992.
D. Zagier, Modular Parametrizations of Elliptic Curves, Canadian. Math. Bull. (1985) 28, 372–384.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cremona, J.E. (1994). Computing the degree of a modular parametrization. In: Adleman, L.M., Huang, MD. (eds) Algorithmic Number Theory. ANTS 1994. Lecture Notes in Computer Science, vol 877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58691-1_50
Download citation
DOI: https://doi.org/10.1007/3-540-58691-1_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58691-3
Online ISBN: 978-3-540-49044-9
eBook Packages: Springer Book Archive