Related papers: Constructing elliptic curves over finite fields wi…

This paper deals with elliptic equations in the plane with degeneracies. The equations are generated by a complex vector field that is elliptic everywhere except along a simple closed curve. Kernels for these equations are constructed.…

We describe methods to determine all the possible torsion groups of an elliptic curve that actually appear over a fixed quadratic field. We use these methods to find, for each group that can appear over a quadratic field, the field with the…

Using the rank of the Mordell-Weil group $E(\mathbb{Q})$ of an elliptic curve $E$ over $\mathbb{Q}$, we give a lower bound of the class number of the number field $\mathbb{Q}(E[p^n])$ generated by $p^n$-division points of $E$ when the curve…

We show how to construct Darmon points on elliptic curves over totally real fields.

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…

In this paper, we establish the modularity of every elliptic curve $E/F$, where $F$ runs over infinitely many imaginary quadratic fields, including $\mathbb{Q}(\sqrt{-d})$ for $d=1,2,3,5$. More precisely, let $F$ be imaginary quadratic and…

We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good…

Given a prime q and a negative discriminant D, the CM method constructs an elliptic curve E/\Fq by obtaining a root of the Hilbert class polynomial H_D(X) modulo q. We consider an approach based on a decomposition of the ring class field…

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…

We consider the reliable implementation of an adaptive high-order unfitted finite element method on Cartesian meshes for solving elliptic interface problems with geometrically curved singularities. We extend our previous work on the…

Given a non-isotrivial elliptic curve over $\mathbb{Q}(t)$ with large Mordell-Weil rank, we explain how one can build, for suitable small primes $p$, infinitely many fields of degree $p^2-1$ whose ideal class group has a large $p$-torsion…

We present a detailed analysis of how to implement the computation of modular symbols for a given elliptic curve by using numerical approximations. This method turns out to be more efficient than current implementation as the conductor of…

We study the number of elliptic curves, up to isomorphism, over a fixed quartic field $K$ having a prescribed torsion group $T$ as a subgroup. Let $T=\Z/m\Z \oplus \Z/n\Z$, where $m|n$, be a torsion group such that the modular curve…

We classify the possible torsion structures of rational elliptic curves over cubic fields. Along the way we find a previously unknown torsion structure over a cubic field, $\Z /21 \Z$, which corresponds to a sporadic point on $X_1(21)$ of…

We give an asymptotic formula for the number of elliptic curves over $\mathbb{Q}$ with bounded Faltings height. Silverman has shown that the Faltings height for elliptic curves over number fields can be expressed in terms of modular…

We obtain $C^2$ a priori estimates for solutions of the nonlinear second-order elliptic equation related to the geometric problem of finding a strictly locally convex hypersurface with prescribed curvature and boundary in a space form.…

We give a simple proof of the well-known divisibility by 2 condition for rational points on elliptic curves with rational 2-torsion. As an application of the explicit division by $2^n$ formulas obtained in Sec.2, we construct versal…

In this paper, we present a probabilistic algorithm to compute the number of $\mathbb{F}_p$-points of modular curve $X_1(n)$. Under the Generalized Riemann Hypothesis(GRH), the algorithm takes…

Despite the rapidly evolving field of computational electromagnetics, few open-source tools have managed to tackle the problem of automatic mesh generation for properly discretizing the problem of interest into a finite set of elements…

In this paper, a novel technique for tight outer-approximation of the intersection region of a finite number of ellipses in 2-dimensional (2D) space is proposed. First, the vertices of a tight polygon that contains the convex intersection…