Related papers: Efficient computation of p-adic heights

Let E/Q be an elliptic curve and p a rational prime of good ordinary reduction. For every imaginary quadratic field K/Q satisfying the Heegner hypothesis for E we have a corresponding line in E(K)\otimes Q_p, known as a shadow line. When…

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 introduce an algorithm that can be used to compute the canonical height of a point on an elliptic curve over the rationals in quasi-linear time. As in most previous algorithms, we decompose the difference between the canonical and the…

In this note we obtain effective lower bounds for the canonical heights of non-torsion points on $E(\mathbb{Q})$ by making use of suitable elliptic curve ideal class pairings $$\Psi_{E,-D}: E(\mathbb{Q})\times E_{-D}(\mathbb{Q})\mapsto…

Let $p\ge5$ be a prime and $T$ a Kodaira type of the special fiber of an elliptic curve. We estimate the number of elliptic curves over $\mathbb Q$ up to height $X$ with Kodaira type $T$ at $p$. This enables us find the proportion of…

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…

We give a new construction of $p$-adic heights on varieties over number fields using $p$-adic Arakelov theory. In analogy with Zhang's construction of real-valued heights in terms of adelic metrics, these heights are given in terms of…

We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8 % to 8.5 % over the best known general methods when using affine coordinates. This is achieved by eliminating a field multiplication…

We present an efficient algorithm for computing certain special values of Rankin triple product $p$-adic L-functions and give an application of this to the explicit construction of rational points on elliptic curves.

We describe the practical implementation of an average polynomial-time algorithm for counting points on superelliptic curves defined over $\mathbb Q$ that is substantially faster than previous approaches. Our algorithm takes as input a…

We compute a lower bound of the canonical height on quadratic twists of certain elliptic curves. Also we show a simple method for constructing families of quadratic twists with an explicit rational point. % from cubic polynomials. Using the…

In this paper, we give an explicit description of the de Rham and p-adic polylogarithms for elliptic curves using the Kronecker theta function. We prove in particular that when the elliptic curve has complex multiplication and good…

We present a deterministic algorithm that computes the zeta function of a nonsupersingular elliptic curve E over a finite field with p^n elements in time quasi-quadratic in n. An older algorithm having the same time complexity uses the…

In this paper, we develop an algorithm for computing Coleman--Gross (and hence Nekov\'a\v{r}) $p$-adic heights on hyperelliptic curves over number fields with arbitrary reduction type above $p$. This height is defined as a sum of local…

We present an algorithm that computes the Hasse-Witt matrix of given hyperelliptic curve over Q at all primes of good reduction up to a given bound N. It is simpler and faster than the previous algorithm developed by the authors.

Let E be an elliptic curve with additive reduction over the p-adic numbers, and let G be the group of p-adic points on E that have good reduction. This paper gives necessary and sufficient conditions for G to contain non-trivial p-torsion.

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 article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field of cardinality $q$ with time complexity $O(n^{2+o(1)})$…

We give a direct proof that the Mazur-Tate and Coleman-Gross heights on elliptic curves coincide. The main ingredient is to extend the Coleman-Gross height to the case of divisors with non-disjoint support and, doing some $p$-adic analysis,…

We present an efficient algorithm to compute the Hasse-Witt matrix of a hyperelliptic curve C/Q modulo all primes of good reduction up to a given bound N, based on the average polynomial-time algorithm recently introduced by Harvey. An…