Related papers: Extending Lenstra's Primality Test to CM elliptic …

Let C/Q be a curve of genus three, given as a double cover of a plane conic. Such a curve is hyperelliptic over the algebraic closure of Q, but may not have a hyperelliptic model of the usual form over Q. We describe an algorithm that…

We prove a quantitative rigidity result for almost constant mean curvature spheres in $\mathbb{R}^3$. Under a sub--two--sphere Willmore bound and a small $L^2$--CMC defect, we show that an almost--CMC surface is close to the round sphere,…

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…

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…

Let $K$ be an imaginary quadratic field and $E/\mathbb{Q}$ an elliptic curves with complex multiplication by $\mathcal{O}_K$. Let $K_\infty/K$ be the anticyclotomic $\mathbb{Z}_p$-extension of $K$ and $K_n$ the intermediate layers. Under…

While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization. We present a quantum algorithm that can optimize a…

We analyse the complexity of the computation of the class group structure, regulator, and a system of fundamental units of a certain class of number fields. Our approach differs from Buchmann's, who proved a complexity bound of L(1/2,O(1))…

We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized…

We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two fields of cardinality $q^n$, our algorithm takes $$n^{1+o(1)} \log^{1+o(1)}q + \max_{\ell}…

We study the quasilinear elliptic system \[ -\textbf{div}(A(x,\boldsymbol u)|D\boldsymbol u|^{p-2}D\boldsymbol u) +\frac{1}{p}\nabla_{\boldsymbol s}A(x,\boldsymbol u)|D\boldsymbol u|^p = \boldsymbol g(x,\boldsymbol u) \quad \text{in }…

In this paper, we explicitly classify the minimal discriminants of all elliptic curves $E/\mathbb{Q}$ with a non-trivial torsion subgroup. This is done by considering various parameterized families of elliptic curves with the property that…

For a given elliptic curve $E/\mathbb{Q}$, let $N_p(E)$ be the number of points on $E$ modulo $p$ for a prime of good reduction for $E$. Given integer $n$, let $G_k(E,n)$ be the number of $k$-tuples of $p_1<p_2<\ldots <p_k$ primes of good…

We consider the problem of learning a general graph $G=(V,E)$ using edge-detecting queries, where the number of vertices $|V|=n$ is given to the learner. The information theoretic lower bound gives $m\log n$ for the number of queries, where…

Let N = 1 mod 4 be the negative of a prime, K=Q(sqrt{N}) and O_K its ring of integers. Let D be a prime ideal in O_K of prime norm congruent to 3 modulo 4. Under these assumptions, there exists Hecke characters $\psi_{\D}$ of K with…

Let E be an elliptic curve without complex multiplication (CM) over a number field K, and let G_E(ell) be the image of the Galois representation induced by the action of the absolute Galois group of K on the ell-torsion subgroup of E. We…

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

The problem of curve registration appears in many different areas of applications ranging from neuroscience to road traffic modeling. In the present work, we propose a nonparametric testing framework in which we develop a generalized…

We propose, analyze, and test a proximal-gradient method for solving regularized optimization problems with general constraints. The method employs a decomposition strategy to compute trial steps and uses a merit function to determine step…

Clemm and Trebat-Leder (2014) proved that the number of quadratic number fields with absolute discriminant bounded by $x$ over which there exist elliptic curves with good reduction everywhere and rational $j$-invariant is $\gg…

In a recent work the authors prove the effective asymptotic Fermat's Last Theorem for the infinite family of fields $\mathbb{Q}(\zeta_{2^{r+2}})^+$ where $r \ge 0$. A crucial step in their proof is the following conjecture of Kraus. Let $K$…