Related papers: Method for constructing elliptic curves using comp…
Enge and Schertz gave the method of using the double eta-quotient for the construction of elliptic curves over finite fields. In their method, it is necessary to count the number of rational points of elliptic curves corresponding to…
We give an efficient algorithm to compute equations of twists of hyperelliptic curves of arbitrary genus over any separable field (of characteristic different from 2), and we explicitly describe some interesting examples.
We provide a generalization of an algebraic linear combination for the trace of certain elliptic modular forms, and through specializing the expression at a suitable pair consisting of an elliptic curve over algebraic number fields and its…
For each $t\in\mathbb{Q}\setminus\{-1,0,1\}$, define an elliptic curve over $\mathbb{Q}$ by \begin{align*} E_t:y^2=x(x+1)(x+t^2). \end{align*} Using a formula for the root number $W(E_t)$ as a function of $t$ and assuming some standard…
In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…
We exhibit an algorithm to compute equations of an algebraic curve over a computable characteristic 0 field from the power series expansions of its regular 1-forms at a nonrational point of the curve, extending a 2005 algorithm of Baker,…
We present a new approach to handling the case of Atkin primes in Schoof's algorithm for counting points on elliptic curves over finite fields. Our approach is based on the theory of polynomially cyclic algebras, which we recall as far as…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
We give explicit numerical estimates for the generalized Chebyshev functions. Explicit results of this kind are useful for estimating of computational complexity of algorithms which generates special primes. Such primes are needed to…
Several problems which could be thought of as belonging to recreational mathematics are described. They are all such that solutions to the problem depend on finding rational points on elliptic curves. Many of the problems considered lead to…
I provide a systematic construction of points (defined over number fields) on Legendre elliptic curves over $\mathbb{Q}$: for any odd integer $n\geq 3$ my method constructs $n$ points on the Legendre curve and I show that rank of the…
For small odd primes $p$, we prove that most of the rational points on the modular curve $X_0(p)/w_p$ parametrize pairs of elliptic curves having infinitely many supersingular primes. This result extends the class of elliptic curves for…
We construct isotrivial and non-isotrivial elliptic curves over $\mathbb{F}_q(t)$ with an arbitrarily large set of separable integral points. As an application of this construction, we prove that there are isotrivial log-general type…
Given a prime power q, for every pair of positive integers m and n with m dividing the GCD of n and q-1, we construct a modular curve over F_q that parametrizes elliptic curves over F_q along with F_q-defined points P and Q of order m and…
We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two fields of cardinality $q^n$, our algorithm takes $$n^{1+o(1)} \log^{1+o(1)}q + \max_{\ell}…
Let $k$ be a number field. We refine a construction of Mestre--Shioda to construct (infinite) families of hyperelliptic curves $X/{k}$ having a record number of rational points and record Mordell--Weil rank relative to the genus of $g$ of…
We give a simple proof of the well-known divisibility by 2 condition for rational points on elliptic curves with rational 2-torsion. As an application of the explicit division by $2^n$ formulas obtained in Sec.2, we construct versal…
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…
We present a deterministic and explicit algorithm to compute the endomorphism rings of supersingular elliptic curves. As an example we compute the endomorphism rings of all supersingular elliptic curves defined over characteristic…
We prove that all elliptic curves defined over totally real cubic fields are modular. This builds on previous work of Freitas, Le Hung and Siksek, who proved modularity of elliptic curves over real quadratic fields, as well as recent…