Related papers: Computing Canonical Heights on Elliptic Curves in …

We use Arakelov theory to define a height on divisors of degree zero on a hyperelliptic curve over a global field, and show that this height has computably bounded difference from the N\'eron-Tate height of the corresponding point on the…

In recent years, the question of whether the ranks of elliptic curves defined over $\mathbb{Q}$ are unbounded has garnered much attention. One can create refined versions of this question by restricting one's attention to elliptic curves…

In the theory and practice of inverse problems for partial differential equations (PDEs) much attention is paid to the problem of the identification of coefficients from some additional information. This work deals with the problem of…

We give a classification of all possible $2$-adic images of Galois representations associated to elliptic curves over $\mathbb{Q}$. To this end, we compute the 'arithmetically maximal' tower of 2-power level modular curves, develop…

We give the first explicit examples beyond the Chabauty-Coleman method where Kim's nonabelian Chabauty program determines the set of rational points of a curve defined over $\mathbb{Q}$ or a quadratic number field. We accomplish this by…

We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…

We introduce a quantization of the graded algebra of functions on the canonical cone of an algebraic curve C, based on the theory of formal pseudodifferential operators. When C is a complex curve with Poincar\'e uniformization, we propose…

We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…

We describe an algorithm to compute the local Coleman-Gross p-adic height at p on a hyperelliptic curve. Previously, this was only possible using an algorithm due to Balakrishnan and Besser, which was limited to odd degree. While we follow…

We propose an algorithm that calculates isogenies between elliptic curves defined over an extension $K$ of $\mathbb{Q}_2$. It consists in efficiently solving with a logarithmic loss of $2$-adic precision the first order differential…

We introduce a new canonical height function for Jordan blocks of small eigenvalues for endomorphisms on smooth projective varieties over a number field. We prove that under an assumption on the eigenvalues of the endomorphism on the group…

In this paper, we will give a uniform upper bound of the number of rational points of bounded height in non-singular curves by applying the global determinant method.

We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…

In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…

Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node n levels from the root.…

We count by height the number of elliptic curves over the rationals that possess an isogeny of degree three.

Several problems which could be thought of as belonging to recreational mathematics are described. They are all such that solutions to the problem depend on finding rational points on elliptic curves. Many of the problems considered lead to…

We construct quantum algorithms to compute physical observables of nonlinear PDEs with M initial data. Based on an exact mapping between nonlinear and linear PDEs using the level set method, these new quantum algorithms for nonlinear…

We count by height the number of elliptic curves over the rationals, both up to isomorphism over the rationals and over an algebraic closure thereof, that admit a cyclic isogeny of degree $7$.

We look for elliptic curves featuring rational points whose coordinates form two arithmetic progressions, one for each coordinate. A constructive method for creating such curves is shown, for lengths up to 5.