Related papers: Computing in Jacobians of projective curves over f…

A survey on algorithms for computing discrete logarithms in Jacobians of curves over finite fields.

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…

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.…

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…

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…

We describe algorithms for computing the intersection numbers of divisors and of Chern classes of the Hodge bundle on the moduli spaces of stable pointed curves. We also discuss the implementations and the results obtained. There are…

Let $X$ be a smooth projective curve over a finite field of characteristic $p$. We describe and implement a practical algorithm for computing the $p$-divisible group $Jac(X)[p^\infty]$ via computing its Dieudonn\'{e} module, or equivalently…

The aim of this paper is to present an algebro-geometric approach to the study of the geometry of the moduli space of stable bundles on a smooth projective curve defined over an algebraically closed field $k$, of arbitrary characteristic.…

We relate Fourier transforms between compactified Jacobians over the moduli space of stable curves to logarithmic Abel-Jacobi theory. As an application, we compute the pushforward of divisor monomials on compactified Jacobians in terms of…

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…

In this work, we present an efficient method for computing in the generalized Jacobian of special singular curves, nodal curves. The efficiency of the operation is due to the representation of an element in the Jacobian group by a single…

In general, algorithms for computing the Selmer group of the Jacobian of a curve have relied on either homogeneous spaces or functions on the curve. We present a theoretical analysis of algorithms which use functions on the curve, and show…

We extend our method to compute division polynomials of Jacobians of curves over Q to curves over Q(t), in view of computing mod ell Galois representations occurring in the \'etale cohomology of surfaces over Q. Although the division…

We study the structure of Jacobians of geometrically reduced curves over arbitrary (i. e., not necessarily perfect) fields. We show that, while such a group scheme cannot in general be decomposed into an affine and an Abelian part as over…

The theory of Q-Cartier divisors on the space of n-pointed, genus 0, stable maps to projective space is considered. Generators and Picard numbers are computed. A recursive algorithm computing all top intersection products of Q-Divisors is…

Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the…

Let $C$ be a curve of genus $g$ over a field $k$. We describe probabilistic algorithms for addition and inversion of the classes of rational divisors in the Jacobian of $C$. After a precomputation, which is done only once for the curve $C$,…

We consider the issue of when the L-polynomial of one curve over $\F_q$ divides the L-polynomial of another curve. We prove a theorem which shows that divisibility follows from a hypothesis that two curves have the same number of points…

We provably compute the full set of rational points on 1403 Picard curves defined over $\mathbb{Q}$ with Jacobians of Mordell-Weil rank $1$ using the Chabauty-Coleman method. To carry out this computation, we extend Magma code of…

We address the problem of computing in the group of $\ell^k$-torsion rational points of the jacobian variety of algebraic curves over finite fields, with a view toward computing modular representations.