相关论文: An algorithm for computing the Weierstrass normal …

We derive an efficient algorithm to find solutions to Euler's concordant form problem and rational points on elliptic curves associated with this problem.

Elliptic functions are largely studied and standardized mathematical objects. The two usual approaches are due to Jacobi and Weierstrass. From a contour integral which allowed us to unify many summation formulae (Euler-MacLaurin, Poisson,…

We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…

In this note we give an algorithm to explicitly construct the modular parametrization of an elliptic curve over the rationals given the Weierstrass function $\wp (z)$.

We present a simple and efficient algorithm to compute the sum of the algebraic conjugates of a point on an elliptic curve.

We present an efficient algorithm to compute the Hasse-Witt matrix of a hyperelliptic curve C/Q modulo all primes of good reduction up to a given bound N, based on the average polynomial-time algorithm recently introduced by Harvey. An…

We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic methods.

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 describe an algorithm that determines a set of unramified covers of a given hyperelliptic curve, with the property that any rational point will lift to one of the covers. In particular, if the algorithm returns an empty set, then the…

This is an introduction to a probabilistic model for the arithmetic of elliptic curves, a model developed in a series of articles of the author with Bhargava, Kane, Lenstra, Park, Rains, Voight, and Wood. We discuss the theoretical evidence…

We show how to speed up the computation of isomorphisms of hyperelliptic curves by using covariants. We also obtain new theoretical and practical results concerning models of these curves over their field of moduli.

We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $p$ by revisiting the idea of working with supersingular elliptic curves. The best known algorithms to this date are based on…

We define the concept of Tschirnhaus-Weierstrass curve, named after the Weierstrass form of an elliptic curve and Tschirnhaus transformations. Every pointed curve has a Tschirnhaus-Weierstrass form, and this representation is unique up to a…

We consider a pointed curve $(X,P)$ which is given by the Weierstrass normal form, $y^r + A_{1}(x) y^{r-1} + A_{2}(x) y^{r-2} +\cdots + A_{r-1}(x) y + A_{r}(x)$ where $x$ is an affine coordinate on $\mathbb{P}^1$, the point $\infty$ on $X$…

It is a classical result (apparently due to Tate) that all elliptic curves with a torsion point of order n ($4 \leq n \leq 10$, or n = 12) lie in a one-parameter family. However, this fact does not appear to have been used ever for…

New problem is studied that is to find nonlinear differential equations with special solutions expressed via the Weierstrass function. Method is discussed to construct nonlinear ordinary differential equations with exact solutions. Main…

We present algorithms for computing the squared Weil and Tate pairings on elliptic curves and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced in this paper have the advantage that our algorithms for…

In this note we combine the advantages of the methods of Siegel-Baker-Coates and of Lang-Zagier for the computation of S-integral points on elliptic curves in Weierstrass normal form over the rationals. In this way we are able to overcome…

We find a closed formula for the number $\operatorname{hyp}(g)$ of hyperelliptic curves of genus $g$ over a finite field $k=\mathbb{F}_q$ of odd characteristic. These numbers $\operatorname{hyp}(g)$ are expressed as a polynomial in $q$ with…

We present an algorithm for the computation of period matrices and the Abel-Jacobi map of complex superelliptic curves given by an equation $y^m=f(x)$. It relies on rigorous numerical integration of differentials between Weierstrass points,…