Related papers: An algorithm for determining torsion growth of ell…

For a prime $p$ and a rational elliptic curve $E_{/\mathbb{Q}}$, set $K=\mathbb{Q}(E[p])$ to denote the torsion field generated by $E[p]:=\operatorname{ker}\{E\xrightarrow{p} E\}$. The class group $\operatorname{Cl}_K$ is a module over…

Let $M \mid N$ be positive integers, and let $\Delta$ be the discriminant of an order in an imaginary quadratic field $K$. When $\Delta_K < -4$, the first author determined the fiber of the morphism $X_0(M,N) \rightarrow X(1)$ over the…

We show in some detail how to implement Shor's efficient quantum algorithm for discrete logarithms for the particular case of elliptic curve groups. It turns out that for this problem a smaller quantum computer can solve problems further…

This paper studies the task of two-sources randomness extractors for elliptic curves defined over finite fields $K$, where $K$ can be a prime or a binary field. In fact, we introduce new constructions of functions over elliptic curves which…

Fix an integer $d>0$. In 2008, David and Weston showed that, on average, an elliptic curve over $\mathbf{Q}$ picks up a nontrivial $p$-torsion point defined over a finite extension $K$ of the $p$-adics of degree at most $d$ for only…

We prove that, when elliptic curves $E/\mathbb{Q}$ are ordered by height, the average number of integral points $\#|E(\mathbb{Z})|$ is bounded, and in fact is less than $66$ (and at most $\frac{8}{9}$ on the minimalist conjecture). By…

We classify the possible torsion structures of rational elliptic curves over sextic number fields.

Let $E$ be an elliptic curve with good reduction at a fixed odd prime $p$ and $K$ an imaginary quadratic field where $p$ splits. We give a growth estimate for the Mordell-Weil rank of $E$ over finite extensions inside the…

The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…

We present the first algorithm to morph graphs on the torus. Given two isotopic essentially 3-connected embeddings of the same graph on the Euclidean flat torus, where the edges in both drawings are geodesics, our algorithm computes a…

Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…

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 elliptic curve in the $\mathbb{Q}$-isogeny class…

The congruent number elliptic curves are defined by $E_d: y^2=x^3-d^2x$, where $d\in \mathbb{N}.$ We give a simple proof of a formula for $L(\mathrm{Sym}^2(E_d),3)$ in terms of the determinant of the elliptic trilogarithm evaluated at some…

Let $K$ be a number field, $S$ a finite set of places. For $\mathbb{G}_m$ or an elliptic curve $E$ defined over $K$, we establish uniformity results on the number of $S$-integral torsion points relative to a non-torsion point $\beta$, as…

Let $E$ be an elliptic curve and $\pi:E\to\mathbb{P}^{1}$ a standard double cover identifying $\pm P\in E$. It is known that for some torsion points $P_{i}\in E$, $1\leq i\leq4$, the cross ratio of $\{\pi(P_{i})\}_{i=1}^{4}$ is independent…

We prove quantitative upper bounds for the number of quadratic twists of a given elliptic curve $E/\Fp_q(C)$ over a function field over a finite field that have rank $\geq 2$, and for their average rank. The main tools are constructions and…

Given an elliptic curve E over the rational with no rational 2-torsion points, we prove the existence of a quadratic twist of E for which the 2-Selmer rank is less than or equal to 1. By the author's earlier result, we establish a lower…

We present new quantum algorithms for Triangle Finding improving its best previously known quantum query complexities for both dense and spare instances.For dense graphs on $n$ vertices, we get a query complexity of $O(n^{5/4})$ without any…

We study arithmetic progressions of squares over quadratic extensions of number fields. Using a method inspired by an approach of Mordell, we characterize such progressions as quadratic points on a genus $5$ curve. Specifically, we…

In this paper we study the problem of how to determine all elliptic curves defined over an arbitrary number field $K$ with good reduction outside a given finite set of primes $S$ of $K$ by solving $S$-unit equations. We give examples of…