Related papers: Complex Multiplication Tests for Elliptic Curves

The modularity of elliptic curves always intrigues number theorists. Recently, Thorne had proved a marvelous result that for a prime $ p $, every elliptic curve defined over a $ p $-cyclotomic extension of $ \mathbb{Q} $ is modular. The…

The CM class number one problem for elliptic curves asked to find all elliptic curves defined over the rationals with non-trivial endomorphism ring. For genus-2 curves it is the problem of determining all CM curves of genus $2$ defined over…

There are three kinds of multiple polylogarithms; complex, finite and symmetric. The dualities for the complex and finite cases are known. In this paper, we present proofs of them via iterated integrals and its symmetric counterpart by a…

We indicate a strategy in order to construct bilinear multiplication algorithms of type Chudnovsky in large extensions of any finite field. In particular, by using the symmetric version of the generalization of Randriambololona specialized…

We analyze log-algebraic power series identities for formal groups of elliptic curves over $\mathbb{Q}$ which arise from modular parametrizations. We further investigate applications to special values of elliptic curve $L$-functions.

This note gives explicit equations for the elliptic curves (in characteristic not 2 or 3) with mod 2 representation isomorphic to that of a given one.

This article deals with new polynomial time algorithm for graph isomorphism testing.

We give a classification of all possible $2$-adic images of Galois representations associated to elliptic curves over $\mathbb{Q}$. To this end, we compute the 'arithmetically maximal' tower of 2-power level modular curves, develop…

We prove that all elliptic curves defined over real quadratic fields are modular.

The focus in this paper is on elliptic homogenization of a certain kind of possibly non-periodic problems. A non-periodic and two-dimensional example is studied, where we numerically illustrate the homogenized matrix.

This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…

We investigate four properties related to an elliptic curve $E_t$ in Legendre form with parameter $t$: the curve $E_{t}$ has complex multiplication, $E_{-t}$ has complex multiplication, a point on $E_t$ with abscissa $2$ is of finite order,…

We find new examples of complex surfaces with countably many non-isomorphic algebraic structures. Here is one such example: take an elliptic curve $E$ in $\mathbb P^2$ and blow up nine general points on $E$. Then the complement $M$ of the…

The problem of finding elliptical shapes in an image will be considered. We discuss the solution which uses cross-entropy clustering. The proposed method allows the search for ellipses with predefined sizes and position in the space.…

In this paper, we study the problem of sampling random supersingular elliptic curves with unknown endomorphism rings. This problem has recently gained considerable attention as many isogeny-based cryptographic protocols require such…

We show that for any elliptic curve (with j invariant not 0 or 1728) over any field of characteristic different from 2 and 3, there exists an hyperelliptic curve H of genus 5 with two independent maps to the given elliptic curve. We also…

An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…

There are 26 possibilities for the torsion group of elliptic curves defined over quadratic number fields. We present examples of high rank elliptic curves with given torsion group which give the current records for most of the torsion…

Fix m >= 1 and let E be an elliptic curve over Q with complex multiplication. We formulate conjectures on the density of primes p (congruent to one modulo m) for which the pth Fourier coefficient of E is an mth power modulo p; often these…

We consider a quantum polynomial-time algorithm which solves the discrete logarithm problem for points on elliptic curves over $GF(2^m)$. We improve over earlier algorithms by constructing an efficient circuit for multiplying elements of…