Related papers: Counting Points on Genus 2 Curves with Real Multip…

Let p be a prime and let C be a genus one curve over a number field k representing an element of order dividing p in the Shafarevich-Tate group of its Jacobian. We describe an algorithm which computes the set of D in the Shafarevich-Tate…

We give an algorithm for computing an inseparable endomorphism of a supersingular elliptic curve $E$ defined over $\mathbb F_{p^2}$, which, conditional on GRH, runs in expected $O(p^{1/2}(\log p)^2(\log\log p)^3)$ bit operations and…

This paper deals with computing topological invariants such as connected components, boundary surface genus, and homology groups. For each input data set, we have designed or implemented algorithms to calculate connected components,…

There are two types of $J$-holomorphic spheres in a symplectic manifold invariant under an anti-symplectic involution: those that have a fixed point locus and those that do not. The former are described by moduli spaces of $J$-holomorphic…

Let g >= 1 and let Q be a monic, squarefree polynomial of degree 2g + 1 in Z[x]. For an odd prime p not dividing the discriminant of Q, let Z_p(T) denote the zeta function of the hyperelliptic curve of genus g over the finite field F_p…

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 study the intersection of two particular Fermat hypersurfaces in $\mathbb{P}^3$ over a finite field. Using the Kani-Rosen decomposition we study arithmetic properties of this curve in terms of its quotients. Explicit computation of the…

We introduce a general abstract notion of fine compactified Jacobian for nodal curves of arbitrary genus. We focus on genus 1 and prove combinatorial classification results for fine compactified Jacobians in the case of a single nodal curve…

We describe an algorithm for counting points on an arbitrary hyperelliptic curve over a finite field of odd characteristic, using Monsky-Washnitzer cohomology to compute a p-adic approximation to the characteristic polynomial of Frobenius.…

We study some extensions of Grover's quantum searching algorithm. First, we generalize the Grover iteration in the light of a concept called amplitude amplification. Then, we show that the quadratic speedup obtained by the quantum searching…

In this paper, we provide refined sufficient conditions for the quadratic Chabauty method to produce a finite set of points, with the conditions on the rank of the Jacobian replaced by conditions on the rank of a quotient of the Jacobian…

A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it…

We count certain abelian surfaces with potential quaternionic multiplication defined over a number field $K$ by counting points of bounded height on some genus zero Shimura curves.

Let $K$ be an algebraically closed field of characteristic different from $2$, $g$ a positive integer, $f(x)\in K[x]$ a degree $2g+1$ monic polynomial without repeated roots, $C_f: y^2=f(x)$ the corresponding genus g hyperelliptic curve…

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

In this paper we study genus 2 curves whose Jacobians admit a polarized (4,4)-isogeny to a product of elliptic curves. We consider base fields of characteristic different from 2 and 3, which we do not assume to be algebraically closed. We…

We refine the bit complexity analysis of an algorithm for the computation of at least one point per connected component of a smooth real algebraic set, yielding exponential speedup (with respect to the number of variables) compared to prior…

We present a Kedlaya-style point counting algorithm for cyclic covers $y^r = f(x)$ over a finite field $\mathbb{F}_{p^n}$ with $p$ not dividing $r$, and $r$ and $\deg{f}$ not necessarily coprime. This algorithm generalizes the…

There are 42 types of real singular points for irreducible real quintic curves and 49 types of real singular points for reducible real quintic curves. The classification of real singular points for irreducible real quintic curves is…

We provide two families of algorithms to compute characteristic polynomials of endomorphisms and norms of isogenies of Drinfeld modules. Our algorithms work for Drinfeld modules of any rank, defined over any base curve. When the base curve…