Related papers: Period Computations for Covers of Elliptic Curves
For a given elliptic curve $\mathbf{E}$ over a finite field of odd characteristic and a rational function $f$ on $\mathbf{E}$ we first study the linear complexity profiles of the sequences $f(nG)$, $n=1,2,\dots$ which complements earlier…
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…
We propose a solution to the hyperelliptic Schottky problem, based on the use of Jacobian Nullwerte and symmetric models for hyperelliptic curves. Both ingredients are interesting on its own, since the first provide period matrices which…
Let $p$ be a prime and let $\mathbf{E}$ be an elliptic curve defined over the finite field $\mathbb{F}_p$ of $p$ elements. For a point $G\in\mathbf{E}(\mathbb{F}_p)$ the elliptic curve congruential generator (with respect to the first…
A computer-algebra aided method is carried out, for determining geometric objects associated to differential operators that satisfy the elliptic ansatz. This results in examples of Lame curves with double reduction and in the explicit…
We present a detailed analysis of how to implement the computation of modular symbols for a given elliptic curve by using numerical approximations. This method turns out to be more efficient than current implementation as the conductor of…
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…
In this expository paper, we review the formula of Chowla and Selberg for the periods of elliptic curves with complex multiplication, and discuss two methods of proof. One uses Kronecker's limit formula and the other uses the geometry of a…
Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…
We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…
In a previous paper, a point of order 8 on an elliptic curve was calculated. Exploiting the well-known correspondence of the points on an elliptic curve with the points of a respective period parallelogram, we proceed to calculating all…
We calculate the first and second moments of L-functions in the family of quadratic twists of a fixed elliptic curve E over F_q[x], asymptotically in the limit as the degree of the twists tends to infinity. We also compute moments involving…
Let l be a prime number and let E and E' be l-isogenous elliptic curves defined over Q. In this paper we determine the proportion of primes p for which E(F_p) is isomorphic to E'(F_p). Our techniques are based on those developed in…
We are concerned with the question of determining the set $C(\mathbb{Q})$, where $C$ is a curve defined by an equation of the form $y^q=f(x)$, where $q$ is an odd prime and $f$ is a polynomial defined over $\mathbb{Q}$. This question can…
The complexity of the elliptic curve method of factorization (ECM) is proven under the celebrated conjecture of existence of smooth numbers in short intervals. In this work we tackle a different version of ECM which is actually much more…
Given a pair of elliptic curves $E_1,E_2$ over a field $k$, we have a natural map $\text{CH}^1(E_1)_0\otimes\text{CH}^1(E_2)_0\to\text{CH}^2(E_1\times E_2)$, and a conjecture due to Beilinson predicts that the image of this map is finite…
In previous work we determined automorphism groups of cyclic algebraic curves defined over fields of any odd characteristic. In this paper we determine parametric equations of families of curves for each automorphism group for such curves.
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…
We compute the $L$-functions of a large class of algebraic curves, and verify the expected functional equation numerically. Our computations are based on our previous results on stable reduction to calculate the local $L$-factor and the…
An accurate approximation of solutions to elliptic problems in infinite domains is challenging from a computational point of view. This is due to the need to replace the infinite domain with a sufficiently large and bounded computational…