Related papers: A p-adic quasi-quadratic point counting algorithm

We describe an efficient algorithm which, given a principally polarized (p.p.) abelian surface $A$ over $\mathbb{Q}$ with geometric endomorphism ring equal to $\mathbb{Z}$, computes all the other p.p. abelian surfaces over $\mathbb{Q}$ that…

We consider the problem of finding cryptographically suitable Jacobians. By applying a probabilistic generic algorithm to compute the zeta functions of low genus curves drawn from an arbitrary family, we can search for Jacobians containing…

This article concerns the computational complexity of a fundamental problem in number theory: counting points on curves and surfaces over finite fields. There is no subexponential-time algorithm known and it is unclear if it can be…

Nonlinear equations are challenging to solve due to their inherently nonlinear nature. As analytical solutions typically do not exist, numerical methods have been developed to tackle their solutions. In this article, we give a quantum…

We propose a Las Vegas probabilistic algorithm to compute the zeta function of a genus-3 hyperelliptic curve defined over a finite field $\mathbb F_q$, with explicit real multiplication by an order $\mathbb Z[\eta]$ in a totally real cubic…

We transfer the algebro-geometric method of construction of solutions of the discrete KP equation to the finite field case. We emphasize role of the Jacobian of the underlying algebraic curve in construction of the solutions. We illustrate…

The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…

We present efficient algorithms for counting points on a smooth plane quartic curve $X$ modulo a prime $p$. We address both the case where $X$ is defined over $\mathbb F_p$ and the case where $X$ is defined over $\mathbb Q$ and $p$ is a…

We describe an algorithm to compute the local Coleman-Gross p-adic height at p on a hyperelliptic curve. Previously, this was only possible using an algorithm due to Balakrishnan and Besser, which was limited to odd degree. While we follow…

For several applications in the arithmetic of abelian varieties it is important to compute canonical heights. Following Faltings and Hriljac, we show how the canonical height on the Jacobian of a smooth projective curve can be computed…

We classify the graphs that can occur as the graph of rational preperiodic points of a quadratic polynomial over $\bold Q$, assuming the conjecture that it is impossible to have rational points of period $4$ or higher. In particular, we…

We use Arakelov theory to define a height on divisors of degree zero on a hyperelliptic curve over a global field, and show that this height has computably bounded difference from the N\'eron-Tate height of the corresponding point on the…

Let $\mathbb{F}_q$ denote the finite field of odd characteristic $p$ with $q$ elements ($q=p^{n},n\in \mathbb{N} $) and $\mathbb{F}_q^*$ represent the nonzero elements of $\mathbb{F}_{q}$. In this paper, by using the Smith normal form we…

Many algorithms for determining properties of real algebraic or semi-algebraic sets rely upon the ability to compute smooth points. Existing methods to compute smooth points on semi-algebraic sets use symbolic quantifier elimination tools.…

We produce new explicit examples of genus-2 curves over the rational numbers whose Jacobian varieties have rational torsion points of large order. In particular, we produce a family of genus-2 curves over Q whose Jacobians have a rational…

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 introduce a quasi-Newton method optimized for efficiently solving quasi-linear elliptic equations and systems, with a specific focus on GPU-based computation. By approximating the Jacobian matrix with a combination of…

We describe a computation of rational points on genus 3 hyperelliptic curves $C$ defined over $\mathbb{Q}$ whose Jacobians have Mordell-Weil rank 1. Using the method of Chabauty and Coleman, we present and implement an algorithm in Sage to…

Conditionally on the Tate--Shafarevich and Bloch--Kato Conjectures, we give an explicit upper bound on the size of the $p$-adic Chabauty--Kim locus, and hence on the number of rational points, of a smooth projective curve $X/\mathbb{Q}$ of…

This article generalizes the geometric quadratic Chabauty method, initiated over $\mathbb{Q}$ by Edixhoven and Lido, to curves defined over arbitrary number fields. The main result is a conditional bound on the number of rational points on…