相关论文: Addition of Divisors on Hyperelliptic Curves via I…
In this paper we propose a direct and explicit realization of addition of divisors by means of an iterative reduction algorithm. Each iteration of the algorithm is the reduction of a degree $g+1$ divisor to a divisor of degree~$g$. Such an…
For a hyperelliptic curve of genus $g$, a divisor in general position of degree $g+1$ is given by polynomial equations. There is an action from an algebraic group on the representations of divisors by polynomials which fixes divisor…
In a previous joint article with F. Abu Salem, we gave efficient algorithms for Jacobian group arithmetic of "typical" divisor classes on C_{3,4} curves, improving on similar results by other authors. At that time, we could only state that…
We show that there exists a surjection from the set of effective divisors of degree $g$ on a tropical curve of genus $g$ to its Jacobian by using a tropical version of the Riemann-Roch theorem. We then show that the restriction of the…
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…
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.…
Numerical tools for computation of $\wp$-functions, also known as Kleinian, or multiply periodic, are proposed. In this connection, computation of periods of the both first and second kinds is reconsidered. An analytical approach to…
We present an efficient endomorphism for the Jacobian of a curve $C$ of genus 2 (hyperelliptic) for divisors having a Non disjoint support. This extends the work of Costello and Lauter in [12] who calculated explicit formulae for divisor…
We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that many desirable operations…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
We develop the theory of Abelian functions associated with algebraic curves. The growth in computer power and an advancement of efficient symbolic computation techniques has allowed for recent progress in this area. In this paper we focus…
This article gives an introduction for mathematicians interested in numerical computations in algebraic geometry and number theory to some recent progress in algorithmic number theory, emphasising the key role of approximate computations…
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$…
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…
In this note, we extend work of Farkas and Rim\'anyi on applying quadric rank loci to finding divisors of small slope on the moduli space of curves by instead considering all divisorial conditions on the hypersurfaces of a fixed degree…
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…
For the evaluation and inversion of abelian integrals we show that the image of the Abel-Jacobi map of genus less than 5 hyperelliptic curve in its Jacobian is the intersection of shifted theta divisors with specified shifts. Therefore the…
An effective method of computing division polynomials in terms of Mumford coordinates is presented. As an example, division polynomials for $3$- and $4$-torsion divisors on a genus two curve are obtained explicitly in terms of Mumford…
We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and…
In this paper we produce a generating function for the number of hyperelliptic curves (up to translation) on a polarized Abelian surfaces using the crepant resolution conjecture and the Yau-Zaslow formula. We present a formula to compute…