Related papers: Efficient Point-Counting Algorithms for Superellip…
Quadratic Chabauty is a $p$-adic method for determining rational points on curves. Local heights are arithmetic invariants used in the quadratic Chabauty method. We present an algorithm to compute these local heights for hyperelliptic…
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…
We prove the first polynomial bound on the number of monotonic homotopy moves required to tighten a collection of closed curves on any compact orientable surface, where the number of crossings in the curve is not allowed to increase at any…
This paper studies the problem of enumerating all maximal collinear subsets of size at least three in a given set of $n$ points. An algorithm for this problem, besides solving degeneracy testing and the exact fitting problem, can also help…
We present a simple and efficient algorithm to compute the sum of the algebraic conjugates of a point on an elliptic curve.
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 give an overview of the Hidden Subgroup Problem (HSP) as of July 2010, including new results discovered since the survey of arXiv:quant-ph/0411037v1. We recall how the problem provides a framework for efficient quantum algorithms and…
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…
We propose a solution to the hyperelliptic Schottky problem, based on the use of Jacobian Nullwerte and symmetric models for hyperelliptic curves. Both ingredients are interesting on its own, since the first provide period matrices which…
We introduce a new iterative method for computing solutions of elliptic equations with random rapidly oscillating coefficients. Similarly to a multigrid method, each step of the iteration involves different computations meant to address…
Working over an algebraically closed field of arbitrary characteristic we study, for integers $N\geq 2$ and $g\geq 2$, the set of points of order dividing $N$ lying on an irreducible smooth proper curve of genus $g$ embedded in its jacobian…
We present a new method for constructing genus 2 curves over a finite field with a given number of points on its Jacobian. This method has important applications in cryptography, where groups of prime order are used as the basis for…
We extend the method of Cassels for computing the Cassels-Tate pairing on the 2-Selmer group of an elliptic curve, to the case of 3-Selmer groups. This requires significant modifications to both the local and global parts of the…
In the long paper "Family Blowup formula, Admissible Graphs and the Enumeration of Singular Curves (I)" (appearing in JDG), the author solved the enumeration problem of nodal (or general singular) curve counting on algebraic surfaces by…
In this paper, a class of high order numerical schemes is proposed for solving Hamilton-Jacobi (H-J) equations. This work is regarded as an extension of our previous work for nonlinear degenerate parabolic equations, see Christlieb et al.…
We develop a Frank-Wolfe algorithm with corrective steps, generalizing previous algorithms including blended conditional gradients, blended pairwise conditional gradients, and fully-corrective Frank-Wolfe. For this, we prove tight…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
Extraspecial groups form a remarkable subclass of p-groups. They are also present in quantum information theory, in particular in quantum error correction. We give here a polynomial time quantum algorithm for finding hidden subgroups in…
Given a sextic CM field $K$, we give an explicit method for finding all genus 3 hyperelliptic curves defined over $\mathbb{C}$ whose Jacobians are simple and have complex multiplication by the maximal order of this field, via an…
Let O be a maximal order in the quaternion algebra B_p over Q ramified at p and infinity. The paper is about the computational problem: Construct a supersingular elliptic curve E over F_p such that End(E) = O. We present an algorithm that…