Related papers: Fast algorithms for computing isogenies between el…

Principal manifolds serve as useful tool for many practical applications. These manifolds are defined as lines or surfaces passing through "the middle" of data distribution. We propose an algorithm for fast construction of grid…

We introduce a class of iterated integrals, defined through a set of linearly independent integration kernels on elliptic curves. As a direct generalisation of multiple polylogarithms, we construct our set of integration kernels ensuring…

The paper suggests a preconditioning type method for fast solving of elliptic equations with oscillating quasiperiodic coefficients $A_\epsilon$ specified by the small parameter $\epsilon>0$. We use an iteration method generated by an…

Building on Mazur's 1978 work on prime degree isogenies, Kenku determined in 1981 all possible cyclic isogenies of elliptic curves over $\mathbb{Q}$. Although more than 40 years have passed, the determination of cyclic isogenies of elliptic…

In this article with study Tamagawa numbers of elliptic curves defined over $\mathbb{Q}$ that have isogenies or torsion points. More precisely, our aim is either to bound the set of primes primes that can divide their Tamagawa numbers or,…

We propose an efficient dual algorithm for ELP based on Fast Gradient Method. The basic idea - to solve properly regularized dual problem.

The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithms for proving the primality of large numbers. Its running time cannot be proven rigorously, but heuristic arguments show that it should…

We present an unconditional CRT algorithm to compute the modular polynomial $\Phi_\ell(X,Y)$ in quasi-linear time. The main ingredients of our algorithm are: the embedding of $\ell$-isogenies in smooth-degree isogenies in higher dimension,…

We present an algorithm for the computation of period matrices and the Abel-Jacobi map of complex superelliptic curves given by an equation $y^m=f(x)$. It relies on rigorous numerical integration of differentials between Weierstrass points,…

We investigate how various invariants of elliptic curves, such as the discriminant, Kodaira type, Tamagawa number and real and complex periods, change under an isogeny of prime degree p. For elliptic curves over l-adic fields, the…

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

Let $p$ be a prime and $K$ a number field of degree $p$. We count the number of elliptic curves, up to $\bar{K}$-isomorphism, having a prescribed property, where this property is either that the curve contains a fixed torsion group as a…

We count the number of rational elliptic curves of bounded naive height that have a rational $N$-isogeny, for $N \in \{2,3,4,5,6,8,9,12,16,18\}$. For some $N$, this is done by generalizing a method of Harron and Snowden. For the remaining…

Let $\mathcal{E}$ be a $\mathbb{Q}$-isogeny class of elliptic curves defined over $\mathbb{Q}$. The isogeny graph associated to $\mathcal{E}$ is a graph which has a vertex for each element of $\mathcal{E}$ and an edge for each…

Let E be an elliptic curve defined via a Weierstrass equation F(x,y)=0 over an infinite field k. Denote by A the coordinate ring of E. In this note we compute the integral homology of PGL_2(A). We obtain a rigidity result as a corollary.

Using methods from analytic number theory, for $m > 5$ and for $m = 4$, we obtain asymptotics with power-saving error terms for counts of elliptic curves with a cyclic $m$-isogeny up to quadratic twist over the rational numbers. For $m >…

The classical modular polynomial for $j$-invariants describes the relation between two elliptic curves connected by isogenies. This polynomial has been applied to various algorithms in computational number theory, such as point counting on…

We present algorithms for computing the squared Weil and Tate pairings on elliptic curves and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced in this paper have the advantage that our algorithms for…

We give a description of the set of exceptional pairs for a number field $K$, that is the set of pairs $(\ell, j(E))$, where $\ell$ is a prime and $j(E)$ is the $j$-invariant of an elliptic curve $E$ over $K$ which admits an $\ell$-isogeny…

Genus 5 curves can be hyperelliptic, trigonal, or non-hyperelliptic non-trigonal, whose model is a complete intersection of three quadrics in $\mathbb{P}^4$. We present and explain algorithms we used to determine, up to isomorphism over…