Related papers: An Algorithm to Find Rational Points on Elliptic C…
After characterizing the integrable discrete analogue of the Euler's elastica, we focus our attention on the problem of approximating a given discrete planar curve by an appropriate discrete Euler's elastica. We carry out the fairing…
In this paper we construct parameterizations of elliptic curves over the rationals which have many consecutive integral multiples. Using these parameterizations, we perform searches in GMP and Magma to find curves with points of small…
We present normal forms for elliptic curves over a field of characteristic $2$ analogous to Edwards normal form, and determine bases of addition laws, which provide strikingly simple expressions for the group law. We deduce efficient…
A rational perfect cuboid is a rectangular parallelepiped whose edges and face diagonals are given by rational numbers and whose space diagonal is equal to unity. Finding such a cuboid is equivalent to finding a perfect cuboid with all…
We show, that under natural assumptions, solutions of Dirichlet problems for uniformly elliptic divergence form operator can be approximated pointwise by solutions of some versions of Robin problems. The proof is based on stochastic…
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…
For a given elliptic curve, its associated $L$-function evaluated at $1$ is closely related to its real period. In this article, we generalize this principle to a rational curve. We count the rational points over all finite fields and use…
Elliptic partial differential equations are important both from application and analysis points of views. In this paper we apply the Closest Point Method to solving elliptic equations on general curved surfaces. Based on the closest point…
We present experimental evidence to support the widely held belief that one half of all elliptic curves have infinitely many rational points. The method used to gather this evidence is a refinement of an algorithm due to the author which is…
We present an algorithm of finding numerical solutions of pulsar equation. The problem of finding the solutions was reduced to finding expansion coefficients of the source term of the equation in a base of orthogo- nal functions defined on…
Given an elliptic curve ${\mathcal E}$ over a field $K$ it is a challenging problem to write down explicit elements of its endomorphism ring ${\rm End}({\mathcal E});$ the problem amounts to find all possible solutions to a functional…
We establish asymptotic formulas for counting rational points near finite type curves on the plane, generalizing Huang's result.
In this work, we consider the rational points on elliptic curves over finite fields F_{p}. We give results concerning the number of points on the elliptic curve y^2{\equiv}x^3+a^3(mod p)where p is a prime congruent to 1 modulo 6. Also some…
We solve the problem of characteristic numbers of elliptic curves in any dimensional projective space The answers are given in the form of effective recursions. Many numerical examples are provided. A C++ program implementing all the…
In this article we determine several theorems and methods for solving linear congruences and systems of linear congruences, and we find the number of distinct solutions. Many examples of solving congruences are given.
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
In this paper we study elliptic curves which have a number of points whose coordinates are in arithmetic progression. We first motivate this diophantine problem, prove some results, provide a number of interesting examples and, finally…
We consider the structure of rational points on elliptic curves in Weierstrass form. Let x(P)=A_P/B_P^2 denote the $x$-coordinate of the rational point P then we consider when B_P can be a prime power. Using Faltings' Theorem we show that…
A method is presented for computing all the affine equivalences between two rational ruled surfaces defined by rational parametrizations that works directly in parametric rational form, i.e. without computing or making use of the implicit…
A finite element method for elliptic problems with discontinuous coefficients is presented. The discontinuity is assumed to take place along a closed smooth curve. The proposed method allows to deal with meshes that are not adapted to the…