Related papers: Computing isogenies between abelian varieties

We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of semialgebraic sets given by Boolean formulas. The algorithm works in weak exponential time. This means that outside a…

In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…

We have developed in the past several algorithms with intrinsic complexity bounds for the problem of point finding in real algebraic varieties. Our aim here is to give a comprehensive presentation of the geometrical tools which are…

Castryck, Decru, and Smith used superspecial genus-2 curves and their Richelot isogeny graph for basing genus-2 isogeny cryptography, and recently, Costello and Smith devised an improved isogeny path-finding algorithm in the genus-2…

We construct parametrized isometric tensor network states -- referred to as skeletons -- that allow us to explore phases of abelian topological order and can be efficiently implemented on quantum processors. We obtain stable finite…

Let $K$ be a number field. We present several new finiteness results for isomorphism classes of abelian varieties over $K$ whose $\ell$-power torsion fields are arithmetically constrained for some rational prime $\ell$. Such arithmetic…

We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in…

We construct infinitely many abelian surfaces A defined over the rational numbers such that, for a prime ell <= 7, the ell-torsion subgroup of A is not isomorphic as a Galois module to the ell-torsion subgroup of its dual. We do this by…

In this paper we study Hodge classes on complex abelian varieties. We prove some general results that allow us, in certain cases, to compute the Hodge group of a product abelian variety $X = X_1 \times X_2$ once we know the Hodge groups of…

A phylogenetic variety is an algebraic variety parameterized by a statistical model of the evolution of biological sequences along a tree. Understanding this variety is an important problem in the area of algebraic statistics with…

Let G be a finite group. For each integral representation $\rho$ of G we consider $\rho-$decomposable principally polarized abelian varieties; that is, principally polarized abelian varieties (X,H) with $\rho(G)-$action, of dimension equal…

In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of…

Let $U/K$ be a smooth affine curve over a number field and let $L$ be an irreducible rank 3 $\overline{\mathbb Q}_{\ell}$-local system on $U$ with trivial determinant and infinite geometric monodromy around a cusp. Suppose further that $L$…

In this note we show that any basic abelian variety with additional structures over an arbitrary algebraically closed field of characteristic $p>0$ is isogenous to another one defined over a finite field. We also show that the category of…

We describe a quasi-linear algorithm for computing Igusa class polynomials of Jacobians of genus 2 curves via complex floating-point approximations of their roots. After providing an explicit treatment of the computations in quartic CM…

Nonlinear differential equations model diverse phenomena but are notoriously difficult to solve. While there has been extensive previous work on efficient quantum algorithms for linear differential equations, the linearity of quantum…

We give a classification of all principally polarized abelian surfaces that admit an $(l,l)$-isogeny to themselves, and show how to compute all the abelian surfaces that occur. We make the classification explicit in the simplest case $l=2$.…

Generalizing a method of Sutherland and the author for elliptic curves, we design a subexponential algorithm for computing the endomorphism rings of ordinary abelian varieties of dimension two over finite fields. Although its correctness…

A lot of work has gone into computing images of Galois representations coming from elliptic curves. This article presents an algorithm to determine the image of the mod-$3$ Galois representation associated to a principally polarized abelian…

We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…