Complex Multiplication Tests for Elliptic Curves
Denis Charles
Abstract
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized algorithm can be adapted to yield the discriminant of the endomorphism ring of the curve.
Create a lesson
Related papers
An ergodic approach to equations of the form x+y=α(n)
Vitaly Bergelson, Hao Pan, Saúl Rodríguez Martín
Rogers--Ramanujan identities from the geometry of Xa=Yb
Yifeng Huang, Kenny Lau, Ken Ono
Computational results on sums of a prime with squares or cubes
Kenny Applegate, Kyle Pratt
Finding New Limit Points of Mahler Measure by Methods of Missing Data Restoration
Jean-Marc Sac-Épée, Souad El Otmani, Armand Maul et al.
Low moments of automorphic random multiplicative function sums
Sun-Kai Leung
A problem of Yang and Chen on weighted representation functions
Shuang-Shuang Li, Ya-Ting Xu, Xiao-Hui Yan