Related papers: Elliptic curves with a given number of points over…

We present an efficient algorithm to compute the Hasse-Witt matrix of a hyperelliptic curve C/Q modulo all primes of good reduction up to a given bound N, based on the average polynomial-time algorithm recently introduced by Harvey. An…

We present computational algorithms to work with points on the modular curve associated to the normaliser of a non-split Cartan group of prime level $p$. Rather than working with explicit equations, we represent these points using the…

We consider the structure of rational points on elliptic curves in Weierstrass form. Let x(P)=A_P/B_P^2 denote the $x$-coordinate of the rational point P then we consider when B_P can be a prime power. Using Faltings' Theorem we show that…

Let $K$ be a number field and $S$ a finite set of places of $K$ containing all archimedean places. In this paper, we show that the second moment of the number of $S$-integral points on elliptic curves over $K$ is bounded. In particular, we…

We prove the $p$-parity conjecture for elliptic curves over global fields of characteristic $p > 3$. We also present partial results on the $\ell$-parity conjecture for primes $\ell \neq p$.

In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…

Under GRH, any element in the multiplicative group of a number field $K$ that is globally primitive (i.e., not a perfect power in $K^*$) is a primitive root modulo a set of primes of $K$ of positive density. For elliptic curves $E/K$ that…

Let E be an elliptic curve over Q, and let n=>1. The central object of study of this article is the division field Q(E[n]) that results by adjoining to Q the coordinates of all n-torsion points on E(Q). In particular, we classify all curves…

We prove that for every number field $K$, there exist infinitely many elliptic curves $E$ over $K$ with rank exactly equal to 1.

Given an elliptic curve $E$ over $\mathbb{Q}$ and non-zero integer $r$, the Lang--Trotter conjecture predicts a striking asymptotic formula for the number of good primes $p\leqslant x$, denoted by $\pi_{E,r}(x)$, such that the Frobenius…

We consider elliptic curves defined by an equation of the form $y^2=x^3+f(t)$, where $f\in k[t]$ has coefficients in a perfect field $k$ of characteristic not $2$ or $3$. By performing $2$ and $3$-descent, we obtain, under suitable…

A simultaneous arithmetic progression (s.a.p.) of length k consists of k points (x_i, y_\sigma(i)), where x_i and y_i are arithmetic progressions and \sigma is a permutation. Garcia-Selfa and Tornero asked whether there is a bound on the…

We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…

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…

In this article, we consider a family of elliptic curves defined by $E_{m}: y^2= x^3 -m^2 x + (pqr)^2 $ where $m $ is a positive integer and $p, q, ~\text{and}~ r$ are distinct odd primes and study the torsion as well the rank of…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$. For a quadratic number field $K$ and an odd prime number $p$, let $L$ be a $\mathbb{Z}_p$-extension of $K$. We prove that $E(L)_{\text{tors}}=E(K)_{\text{tors}}$ when $p>5$. It enables…

It is known, that for every elliptic curve over Q there exists a quadratic extension in which the rank does not go up. For a large class of elliptic curves, the same is known with the rank replaced by the 2-Selmer group. We show, however,…

For a polarized complex Abelian variety A, of dimension g>1, we study the function N_A(t) counting the number of elliptic curves in A with degree bounded by t. We describe elliptic curves as solutions of Diophantine equations which, at…

We present an algorithm that, on input of a positive integer N together with its prime factorization, constructs a finite field F and an elliptic curve E over F for which E(F) has order N. Although it is unproved that this can be done for…

Let E_k denote the elliptic curve defined by y^2 = x(x^2 - k^2). We consider the curves with k = pl, p = l = 1 mod 8 primes, and show that the density of rank-0 curves among them is at least 1/2 by explicitly constructing nontrivial…