Related papers: Counting elliptic curves with a cyclic $m$-isogeny…
We propose a generalization of tropical curves by dropping the rationality and integrality requirements while preserving the balancing condition. An interpretation of such curves as critical points of a certain quadratic functional allows…
For any number field $K$ and integer $0\leq r \leq 4$, we prove that there are infinitely many elliptic curves over $K$ of rank $r$. Our elliptic curves are obtained by specializing well-chosen nonisotrivial elliptic curves over the…
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree $\ell$ ($\ell$ different from the…
For certain families of elliptic curves admitting a rational isogeny of prime degree $\ell$, we establish a central limit theorem for the Tamagawa ratio and derive bounds on its average value. By using the Tamagawa ratio to bound the size…
We obtain a recursive formula for the number of rational degree $d$ curves in $\mathbb{CP}^2$ that pass through $3d+1-m$ generic points and that have an $m$-fold singular point. The special case of counting curves with a triple point was…
Let $E$ be an elliptic curve described by either an Edwards model or a twisted Edwards model over $\mathbb{F}_p$, namely, $E$ is defined by one of the following equations $x^2+y^2=a^2(1+x^2y^2),\, a^5-a\not\equiv 0$ mod $p$, or,…
In this paper, we introduce the study of minimal torsion curves within a fixed geometric isogeny class. For a $\overline{\mathbb{Q}}$-isogeny class $\mathcal{E}$ of elliptic curves and $N \in \mathbb{Z}^+$, we wish to determine the least…
Let $E$ be an elliptic curve defined over $\mathbb{Q}$. In this article, we classify all groups that can arise as $E(\mathbb{Q}(\zeta_p))_{\text{tors}}$ up to isomorphism for any prime $p$. When $p - 1$ is not divisible by small integers…
Given an elliptic curve $E$ over a finite field $\mathbb{F}_q$ we study the finite extensions $\mathbb{F}_{q^n}$ of $\mathbb{F}_q$ such that the number of $\mathbb{F}_{q^n}$-rational points on $E$ attains the Hasse upper bound. We obtain an…
We list the elliptic curves defined over $Q(\sqrt 5)$ with good reduction away from 2. There are 368 isomorphism classes. We give a global minimal model for each class.
A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
In this paper we refine recent work due to A. Shankar, A. N. Shankar, and X. Wang on counting elliptic curves by conductor to the case of elliptic curves with a rational 2-torsion point. This family is a small family, as opposed to the…
We describe deterministic and probabilistic algorithms to determine whether or not a given monic irreducible polynomial H in Z[X] is a Hilbert class polynomial, and if so, which one. These algorithms can be used to determine whether a given…
By Mazur's Torsion Theorem, there are fourteen possibilities for the non-trivial torsion subgroup $T$ of a rational elliptic curve. For each $T$, such that $E$ may have additive reduction at a prime $p$, we consider a parameterized family…
We give some heuristics for counting elliptic curves with certain properties. In particular, we re-derive the Brumer-McGuinness heuristic for the number of curves with positive/negative discriminant up to $X$, which is an application of…
Let $E$ be an elliptic curve defined over $\mathbb{Q}$, and let $K$ be a number field of degree four that is Galois over $\mathbb{Q}$. The goal of this article is to classify the different isomorphism types of $E(K)_{\text{tors}}$.
We introduce the twisted $\boldsymbol{\mu}_4$-normal form for elliptic curves, deriving in particular addition algorithms with complexity $9\mathbf{M} + 2\mathbf{S}$ and doubling algorithms with complexity $2\mathbf{M} + 5\mathbf{S} +…
Elliptic curves are planar curves which can be used to define an abelian group. The efficient computation of discrete logarithms over this group is a longstanding problem relevant to cryptography. It may be possible to efficiently compute…
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…