Related papers: On Division Polynomial PIT and Supersingularity

We develop a boundary integral equation solver for elliptic partial differential equations on complex \threed geometries. Our method is efficient, high-order accurate and robustly handles complex geometries. A key component is our singular…

This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial…

We study the de Rham fundamental group of the configuration space $E^{(n)}$ of $n+1$ marked points on an elliptic curve $E$, and define multiple elliptic polylogarithms. These are multivalued functions on $E^{(n)}$ with unipotent monodromy,…

We give an algorithm to explicitly determine all elements of the $q$-torsion (for $q$ an odd prime) of the Brauer group of an elliptic curve over any base field of characteristic different from $q$, containing a primitive $q$-th root of…

Given an elliptic curve $E$ and a positive integer $N$, we consider the problem of counting the number of primes $p$ for which the reduction of $E$ modulo $p$ possesses exactly $N$ points over $\mathbb F_p$. On average (over a family of…

Let $E$ be the elliptic curve $y^2=x(x+1)(x+t)$ over the field $\Fp(t)$ where $p$ is an odd prime. We study the arithmetic of $E$ over extensions $\Fq(t^{1/d})$ where $q$ is a power of $p$ and $d$ is an integer prime to $p$. The rank of $E$…

We give an algorithm for deciding whether a planar polynomial differential system has a first integral which factorizes as a product of defining polynomials of curves with only one place at infinity. In the affirmative case, our algorithm…

We show that for all epsilon > 0, there is a constant C(epsilon) > 0 such that for all elliptic curves E defined over a number field F with j(E) in Q we have #E(F)[tors] \leq C(epsilon)[F:Q]^{5/2+epsilon}. We pursue further bounds on the…

We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…

We consider an elliptic optimal control problem where the objective functional contains an integral along a surface of codimension 1, also known as a hypersurface. In particular, we use a fidelity term that encourages the state to take…

Given an elliptic curve $E$ defined over $\mathbb{Q}$ which has potential complex multiplication by the ring of integers $\mathcal{O}_K$ of an imaginary quadratic field $K$ we construct a polynomial $P_E \in \mathbb{Z}[x,y]$ which is a…

Let F be the cyclotomic field of fifth roots of unity. We computationally investigate modularity of elliptic curves over F.

Let $E$ be an elliptic curve over $\Q$ without complex multiplication, and which is not isogenous to a curve with non-trivial rational torsion. For each prime $p$ of good reduction, let $|E(\F_p)|$ be the order of the group of points of the…

We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $\mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a…

Let $E/\mathbb{Q}_p$ be an elliptic curve whose mod $p$ Galois image is contained in the normaliser of a non-split Cartan. We classify the possible $p$-adic images of $E$ using tools from $p$-adic Hodge theory via a careful analysis of the…

We consider the cyclotomic identity testing (CIT) problem: given a polynomial $f(x_1,\ldots,x_k)$, decide whether $f(\zeta_n^{e_1},\ldots,\zeta_n^{e_k})$ is zero, where $\zeta_n = e^{2\pi i/n}$ is a primitive complex $n$-th root of unity…

Let $\ell$ and $p \geq 3$ be different primes. Let $E/\mathbb{Q}_\ell$ and $E'/\mathbb{Q}_\ell$ be elliptic curves with isomorphic $p$-torsion. Assume that $E$ has potentially multiplicative reduction. We classify when all…

Two prominent methods for integer factorization are those based on general integer sieve and elliptic curve. The general integer sieve method can be specialized to quadratic integer sieve method. In this paper, a probability analysis for…

Major controversy surrounds the use of Elliptic Curves in finite fields as Random Number Generators. There is little information however concerning the "randomness" of different procedures on Elliptic Curves defined over fields of…

We prove quantitative upper bounds for the number of quadratic twists of a given elliptic curve $E/\Fp_q(C)$ over a function field over a finite field that have rank $\geq 2$, and for their average rank. The main tools are constructions and…