Related papers: Computing the Charlap-Coley-Robbins modular polyno…

For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…

Fix a prime number $\ell$. Graphs of isogenies of degree a power of $\ell$ are well-understood for elliptic curves, but not for higher-dimensional abelian varieties. We study the case of absolutely simple ordinary abelian varieties over a…

Let $p$ be an odd prime number and be an integer coprime to $p$. We survey an algorithm for computing explicit rational representations of $(\ell,...,\ell)$-isogenies between Jacobians of hyperelliptic curves of arbitrary genus over an…

Let K be a number field, and let E be an elliptic curve over K. A famous result by Faltings of 1983 can be reformulated for elliptic curves as follows: if S is a set of primes of good reduction for E having density one, then the K-isogeny…

Let $E:y^2=x^3+ax+b$ be an elliptic curve defined over $\mathbb{Q}$. We compute certain twists of the classical modular curves $X(8)$. Searching for rational points on these twists enables us to find non-trivial pairs of $8$-congruent…

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…

Let \( E \) be a complex elliptic curve with conductor \( N \) and modular invariant \( j(E) \in \mathbb{Q} \). We construct a class of modular polynomials $F_N(x,j)$ that relate the modular function $x$ on $X_0(N)$ to the $j$-invariant…

Let $K$ be a quadratic field which is not an imaginary quadratic field of class number one. We describe an algorithm to compute the primes $p$ for which there exists an elliptic curve over $K$ admitting a $K$-rational $p$-isogeny. This…

Let E be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field K. The field of definition of E is the ring class field Omega of the order. If the prime p splits completely in Omega, then…

For each $t\in\mathbb{Q}\setminus\{-1,0,1\}$, define an elliptic curve over $\mathbb{Q}$ by \begin{align*} E_t:y^2=x(x+1)(x+t^2). \end{align*} Using a formula for the root number $W(E_t)$ as a function of $t$ and assuming some standard…

In this paper, we establish the modularity of every elliptic curve $E/F$, where $F$ runs over infinitely many imaginary quadratic fields, including $\mathbb{Q}(\sqrt{-d})$ for $d=1,2,3,5$. More precisely, let $F$ be imaginary quadratic and…

Let $p$ be an odd prime number and let $X_0^+(p)$ be the quotient of the classical modular curve $X_0(p)$ by the action of the Atkin-Lehner operator $w_p$. In this paper we show how to compute explicit equations for the canonical model of…

As a subproduct of the Schoof-Elkies-Atkin algorithm to count points on elliptic curves defined over finite fields of characteristic p, there exists an algorithm that computes, for l an Elkies prime, l-torsion points in an extension of…

We describe an efficient algorithm which, given a principally polarized (p.p.) abelian surface $A$ over $\mathbb{Q}$ with geometric endomorphism ring equal to $\mathbb{Z}$, computes all the other p.p. abelian surfaces over $\mathbb{Q}$ that…

Let $E$ be an ordinary elliptic curve over a finite field and $g$ be a positive integer. Under some technical assumptions, we give an algorithm to span the isomorphism classes of principally polarized abelian varieties in the isogeny class…

Isogeny volcanoes are graphs whose vertices are elliptic curves and whose edges are $\ell$-isogenies. Algorithms allowing to travel on these graphs were developed by Kohel in his thesis (1996) and later on, by Fouquet and Morain (2001).…

Let $E$ be an elliptic curve over a number field $K$. If for almost all primes of $K$, the reduction of $E$ modulo that prime has rational cyclic isogeny of fixed degree, we can ask if this forces $E$ to have a cyclic isogeny of that degree…

We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…

We present a very efficient algorithm to construct an elliptic curve E and a finite field F such that the order of the point group E(F) is a given prime number N. Heuristically, this algorithm only takes polynomial time Otilde((\log N)^3),…

An isogeny class of elliptic curves over a finite field is determined by a quadratic Weil polynomial. Gekeler has given a product formula, in terms of congruence considerations involving that polynomial, for the size of such an isogeny…