Related papers: Formulas for the arithmetic geometric mean of curv…
We study natural evaluation and interpolation problems for elliptic functions and prove that they allow a recursive treatment using a variant of classical butterflies first introduced by Gauss. We deduce the existence of straight-line…
A finite, simple and undirected graph $G = (V, E)$ with $p$ vertices and $q$ edges is said to be a $k$-geometric mean graph for a positive integer $k$ if there is an injection $\psi :V(G)\to \{k,k+1,\dots,k+q\}$ such that, when each edge…
The complete elliptic integral of the first kind (CEI-1) plays a significant role in mathematics, physics and engineering. There is no simple formula for its computation, thus numerical algorithms are essential for coping with the practical…
Let $X$be a complex hyperelliptic curve of genus two equipped with the canonical metric $ds^2$. We study mean field equations on complex hyperelliptic curves and show that the Gaussian curvature function of $(X,ds^2)$ determines an explicit…
It was first pointed out by Weil that we can use classical invariant theory to compute the Jacobian of a genus one curve. The invariants required for curves of degree n = 2,3,4 were already known to the nineteenth centuary invariant…
We present an algorithm which uses Fujiwara's inequality to bound algebraic functions over ellipses of a certain type, allowing us to concretely implement a rigorous Gauss-Legendre integration method for algebraic functions over a line…
The elliptic curve method (ECM) is one of the best factorization methods available. It is possible to use hyperelliptic curves instead of elliptic curves but it is in theory slower. We use special hyperelliptic curves and Kummer surfaces to…
In this paper, we apply the practical GADI-HS iteration as a smoother in algebraic multigrid (AMG) method for solving second-order non-selfadjoint elliptic problem. Additionally, we prove the convergence of the derived algorithm and…
We present a specialized point-counting algorithm for a class of elliptic curves over F\_{p^2} that includes reductions of quadratic Q-curves modulo inert primes and, more generally, any elliptic curve over F\_{p^2} with a low-degree…
As a subproduct of the Schoof-Elkies-Atkin algorithm to count points on elliptic curves defined over finite fields of characteristic p, there exists an algorithm that computes, for l an Elkies prime, l-torsion points in an extension of…
We develop geometry-of-numbers methods to count orbits in coregular vector spaces having bounded invariants over any global field. We apply these techniques to bound the average ranks and determine average Selmer group sizes of elliptic…
We find equations for the higher dimensional analogue of the modular curve X_0(3) using Mumford's algebraic formalism of algebraic theta functions. As a consequence, we derive a method for the construction of genus 2 hyperelliptic curves…
We design efficient algorithms to evaluate modular equations of Siegel and Hilbert type for abelian surfaces over number fields or finite fields using complex approximations. Their output is provably correct when the associated graded ring…
We introduce a class of iterated integrals, defined through a set of linearly independent integration kernels on elliptic curves. As a direct generalisation of multiple polylogarithms, we construct our set of integration kernels ensuring…
We give geometric and algorithmic criterions in order to have of a proper Galois closure for a codimension one germ of quasi-homogeneous foliation. We recall this notion recently introduced by B. Malgrange, and describe the Galois envelope…
For a given elliptic curve $E_0$ defined over a number field $k$, we construct two families of elliptic curves whose mod 3 representations are isomorphic to that of $E_0$. The isomorphisms in the first family are symplectic, and those in…
Galois orders, introduced in 2010 by V. Futorny and S. Ovsienko, form a class of associative algebras that contain many important examples, such as the enveloping algebra of $\mathfrak{gl}_n$ (as well as its quantum deformation),…
We consider the problem of efficient computation in the Jacobian of a hyperelliptic curve of genus 3 defined over a field whose characteristic is not 2. For curves with a rational Weierstrass point, fast explicit formulas are well known and…
We extend the work of Cremona, Fisher and Stoll on minimising genus one curves of degrees 2,3,4,5, to some of the other representations associated to genus one curves, as studied by Bhargava and Ho. Specifically we describe algorithms for…
Let $K$ be a quadratic field which is not an imaginary quadratic field of class number one. We describe an algorithm to compute the primes $p$ for which there exists an elliptic curve over $K$ admitting a $K$-rational $p$-isogeny. This…