Related papers: Constructing elliptic curves over finite fields wi…

Let $X_\Delta(N)$ be an intermediate modular curve of level $N$, meaning that there exist (possibly trivial) morphisms $X_1(N)\rightarrow X_\Delta(N) \rightarrow X_0(N)$. For all such intermediate modular curves, we give an explicit…

We show that, for all odd natural numbers $N$, the $N$-torsion points on an elliptic curve may be placed in an $N \times N$ grid such that the sum of each column and each row is the point at infinity.

We describe an adaptive version of a method for generating valid naturally curved quadrilateral meshes. The method uses a guiding field, derived from the concept of a cross field, to create block decompositions of multiply connected two…

I provide a systematic construction of points (defined over number fields) on Legendre elliptic curves over $\mathbb{Q}$: for any odd integer $n\geq 3$ my method constructs $n$ points on the Legendre curve and I show that rank of the…

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…

We prove that the group of rational points of a non-isotrivial elliptic curve defined over the perfect closure of a function field in one variable over a finite field is finiteley generated.

We propose a multiscale method for elliptic problems on complex domains, e.g. domains with cracks or complicated boundary. For local singularities this paper also offers a discrete alternative to enrichment techniques such as XFEM. We…

Cutting plane methods, particularly outer approximation, are a well-established approach for solving nonlinear discrete optimization problems without relaxing the integrality of decision variables. While powerful in theory, their…

The modular curve X_0(N) parametrizes elliptic curves together with a cyclic subgroup of order N, and hence cyclic N-isogenies. While explicit moduli descriptions of X_1(N) are well developed, a comparable construction for X_0(N) has…

Let $\mathbb F_{q^2}$ be the finite field with $q^2$ elements. We provide a simple and effective method, using reciprocal polynomials, for the construction of algebraic curves over $\mathbb F_{q^2}$ with many rational points. The curves…

We solve the problem of counting elliptic curves with fixed j-invariant in projective space with tangency conditions. This is equivalent to couting rational nodal curves with condition on the node of the image. The solution is given in the…

Let $E:y^2=x^3+ax+b$ be an elliptic curve defined over $\mathbb{Q}$. We compute certain twists of the classical modular curves $X(8)$. Searching for rational points on these twists enables us to find non-trivial pairs of $8$-congruent…

We derive an efficient algorithm to find solutions to Euler's concordant form problem and rational points on elliptic curves associated with this problem.

We exhibit an algorithm to compute equations of an algebraic curve over a computable characteristic 0 field from the power series expansions of its regular 1-forms at a nonrational point of the curve, extending a 2005 algorithm of Baker,…

We introduce generalised finite difference methods for solving fully nonlinear elliptic partial differential equations. Methods are based on piecewise Cartesian meshes augmented by additional points along the boundary. This allows for…

Given an integer $N \geq 3$, we prove that for any ring $R$ and any finite locally free $R$-group scheme $G$ which is fppf-locally (over $R$) isomorphic the $N$-torsion subscheme of some elliptic curve $E/R$, there is a smooth affine curve…

We give an efficient algorithm to compute equations of twists of hyperelliptic curves of arbitrary genus over any separable field (of characteristic different from 2), and we explicitly describe some interesting examples.

Farin proposed a method for designing Bezier curves with monotonic curvature and torsion. Such curves are relevant in design due to their aesthetic shape. The method relies on applying a matrix M to the first edge of the control polygon of…

We give a method to construct deep holes for elliptic curve codes. For long elliptic curve codes, we conjecture that our construction is complete in the sense that it gives all deep holes. Some evidence and heuristics on the completeness…

We propose a novel method to generate a small set of ruled surfaces that do not collide with the input shape for linear hot-wire rough machining. Central to our technique is a new observation: the ruled surfaces constructed by vertical…