Related papers: Computing L-series of hyperelliptic curves
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 determine all genus 2 curves, defined over $\mathbb C$, which have simultaneously degree 2 and 3 elliptic subcovers. The locus of such curves has three irreducible 1-dimensional genus zero components in $\mathcal M_2$. For each component…
It is known that for a smooth hyperelliptic curve to have a large $a$-number, the genus must be small relative to the characteristic of the field, $p>0$, over which the curve is defined. It was proven by Elkin that for a genus $g$…
Let $C$ be a hyperelliptic curve over $\mathbb Q$ described by $y^2=a_0x^n+a_1x^{n-1}+\ldots+a_n$, $a_i\in\mathbb Q$. The points $P_{i}=(x_{i},y_{i})\in C(\mathbb{Q})$, $i=1,2,...,k,$ are said to be in a geometric progression of length $k$…
We prove that, on average, elliptic curves over Q have finitely many primes p for which they possess a p-adic point of order p. We include a discussion of applications to companion forms and the deformation theory of Galois representations.
We characterise genus 3 complex smooth hyperelliptic curves that contain two additional involutions as curves that can be build from five points in $\mathbb{P}^1$ with a distinguished triple. We are able to write down explicit equations for…
In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…
Consider elliptic curves $ E:\ y^{2} = x^{3} + D^{3} $ defined over the quadratic field $\ \Q(\sqrt{-3}) $. Hecke $ L-$series attached to $ E $ are studied, formulae for their values at $ s=1, $ and bound of 3-adic valuations of these…
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$…
One of the big questions in the area of curves over finite fields concerns the distribution of the numbers of points: Which numbers occur as the number of points on a curve of genus $g$? The same question can be asked of various subclasses…
In this lecture we give a brief introduction to Weierstrass points of curves and computational aspects of $q$-Weierstrass points on superelliptic curves.
Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…
We give an algorithm to compute $(\ell,\ell,\ell)$-isogenies from the Jacobians of genus three hyperelliptic curves to the Jacobians of non-hyperelliptic curves. An important application is to reduce the discrete logarithm problem in the…
We consider the problem of efficient computation in the Jacobian of a hyperelliptic curve of genus 3 defined over a field whose characteristic is not 2. For curves with a rational Weierstrass point, fast explicit formulas are well known and…
Generalized unitarity cut of a Feynman diagram generates an algebraic system of polynomial equations. At high-loop levels, these equations may define a complex curve or a (hyper-)surface with complicated topology. We study the curve cases,…
Let $p$ be an odd prime number. We propose an algorithm for computing rational representations of isogenies between Jacobians of hyperelliptic curves via-adic differential equations with a sharp analysis of the loss of precision.…
Generating Hilbert curves in Z^2 using L-systems appears to be efficient and easy
We present a nonarchimedian method to construct hyperelliptic CM-curves of genus 2.
In this note we consider certain elliptic curves defined over real quadratic fields isogenous to their Galois conjugate. We give a construction of algebraic points on these curves defined over almost totally real number fields. The main…
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…