Related papers: Computing Isomorphisms between Products of Supersi…
The SEA algorithm for computing the cardinality of elliptic curves over finite fields in many characteristic uses modular polynomials. These polynomials come into different flavors, and methods to compute them flourished. Once equipped with…
It is unknown whether two graphs can be tested for isomorphism in polynomial time. A classical approach to the Graph Isomorphism Problem is the d-dimensional Weisfeiler-Lehman algorithm. The d-dimensional WL-algorithm can distinguish many…
Given an elliptic curve E over a field of positive characteristic p, we consider how to efficiently determine whether E is ordinary or supersingular. We analyze the complexity of several existing algorithms and then present a new approach…
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.…
We construct certain elements in the integral motivic cohomology group $H^3_{{\cal M}}(E \times E',\Q(2))_{\ZZ}$, where $E$ and $E'$ are elliptic curves over $\Q$. When $E$ is not isogenous to $E'$ these elements are analogous to…
We establish elliptic regularity for nonlinear inhomogeneous Cauchy-Riemann equations under minimal assumptions, and give a counterexample in a borderline case. In some cases where the inhomogeneous term has a separable factorization, the…
We study regularity properties for solutions to elliptic equations that are degenerate or singular along orthogonal hyperplanes. The degenerate ellipticity is carried out by a weight term which is the monomial product of different powers of…
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…
Isogenies occur throughout the theory of elliptic curves. Recently, the cryptographic protocols based on isogenies are considered as candidates of quantum-resistant cryptographic protocols. Given two elliptic curves $E_1, E_2$ defined over…
In this paper we present a method which, given a singular point $(j_1, j_2)$ on $Y_0(\ell)$ with $j_1, j_2 \neq 0, 1728$ and an elliptic curve $E$ with $j$-invariant ${j_1}$, returns an elliptic curve $\widetilde{E}$ with $j$-invariant…
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
We describe algorithms based on invariant theory to solve problems on the geometry of curves, mainly those of genus 2, 3 and 4. New theoretical results building on the first author's PhD thesis are also included.
In this paper, we propose an algorithm to enumerate genus-4 superspecial hyperelliptic curves whose automorphism groups isomorphic to the quaternion group. By implementing this algorithm with Magma, we successfully obtain the number of…
Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for…
As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…
In insurance mathematics optimal control problems over an infinite time horizon arise when computing risk measures. Their solutions correspond to solutions of deterministic semilinear (degenerate) elliptic partial differential equations. In…
We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc…
Multiple elliptic polylogarithms can be written as (multiple) integrals of products of basic hypergeometric functions. The latter are computable, to arbitrary precision, using a q-difference equation and q-contiguous relations.
We establish a classification of the values of \( N \) for which an elliptic curve defined over \( \mathbb{Q} \) with square discriminant admits an \( N \)-isogeny. Furthermore, we determine the values of \( N \) for which two elliptic…
This paper is devoted to a study of $S$-curves, that is systems of curves in the complex plane whose equilibrium potential in a harmonic external field satisfies a special symmetry property ($S$-property). Such curves have many…