Related papers: Elliptic curves, random matrices and orbital integ…

In this article we introduce Hecke operators on the differential algebra of geometric quasi-modular forms. As an application for each natural number $d$ we construct a vector field in six dimensions which determines uniquely the polynomial…

We introduce an analogue of the Mertens conjecture for elliptic curves over finite fields. Using a result of Waterhouse, we classify the isogeny classes of elliptic curves for which this conjecture holds in terms the size of the finite…

We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…

For a fixed $j$-invariant $j_0$ of an elliptic curve without complex multiplication we bound the number of $j$-invariants $j$ that are algebraic units and such that elliptic curves corresponding to $j$ and $j_0$ are isogenous. Our bounds…

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 study an infinite family of Mordell curves (i.e. the elliptic curves in the form y^2=x^3+n, n \in Z) over Q with three explicit integral points. We show that the points are independent in certain cases. We describe how to compute bounds…

Building upon the recent works of Bertola; Fasondini, Olver and Xu, we define a class of orthogonal polynomials on elliptic curves and establish a corresponding Riemann-Hilbert framework. We then focus on the special case, defined by a…

Inspired by experimental data, this paper investigates which isogeny classes of abelian varieties defined over a finite field of odd characteristic contain the Jacobian of a hyperelliptic curve. We provide a necessary condition by…

For the integer $ D=pq$ of the product of two distinct odd primes, we construct an elliptic curve $E_{2rD}:y^2=x^3-2rDx$ over $\mathbb Q$, where $r$ is a parameter dependent on the classes of $p$ and $q$ modulo 8, and show, under the parity…

We give an efficient, deterministic algorithm to decide if two abelian varieties over a number field are isogenous. From this, we derive an algorithm to compute the endomorphism ring of an elliptic curve over a number field.

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…

Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…

The Deligne-Ogus-Shioda theorem guarantees the existence of isomorphisms between products of supersingular elliptic curves over finite fields. In this paper, we present methods for explicitly computing these isomorphisms in polynomial time,…

We present a new algorithm for computing the endomorphism ring of an ordinary abelian surface over a finite field which is subexponential and generalizes an algorithm of Bisson and Sutherland for elliptic curves. The correctness of this…

We prove the generalised Tate conjecture for H^3 of products of elliptic curves over finite fields, by slightly modifying an argument of M. Spiess concerning the Tate conjecture. We prove it fully if the elliptic curves run among at most 3…

To a pair of elliptic curves, one can naturally attach two K3 surfaces: the Kummer surface of their product and a double cover of it, called the Inose surface. They have prominently featured in many interesting constructions in algebraic…

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

We present a new probabilistic algorithm to compute modular polynomials modulo a prime. Modular polynomials parameterize pairs of isogenous elliptic curves and are useful in many aspects of computational number theory and cryptography. Our…

Isogenies, the mappings of elliptic curves, have become a useful tool in cryptology. These mathematical objects have been proposed for use in computing pairings, constructing hash functions and random number generators, and analyzing the…

The Hilbert class polynomial has as roots the j-invariants of elliptic curves whose endomorphism ring is a given imaginary quadratic order. It can be used to compute elliptic curves over finite fields with a prescribed number of points.…