Related papers: Efficient computation of p-adic heights

This paper initiates the study of quantum algorithms for matroid property problems. It is shown that quadratic quantum speedup is possible for the calculation problem of finding the girth or the number of circuits (bases, flats,…

We prove that a positive proportion of squarefree integers are congruent numbers such that the canonical height of the lowest non-torsion rational point on the corresponding elliptic curve satisfies a strong lower bound.

Let $\E/\Q$ be a fixed elliptic curve over $\Q$ which does not have complex multiplication. Assuming the Generalized Riemann Hypothesis, A. C. Cojocaru and W. Duke have obtained an asymptotic formula for the number of primes $p\le x$ such…

We calculate an explicit lower bound on the proportion of elliptic curves that are modular over any Galois CM field not containing $\zeta_5$. Applied to imaginary quadratic fields, this proportion is at least $2/5$. Applied to cyclotomic…

We develop a theory of $p$-adic N\'eron functions on abelian varieties, depending on various auxiliary choices, and show that the global $p$-adic height functions constructed by Mazur and Tate can be decomposed into a sum of $p$-adic…

For the $n$th cyclotomic polynomial $\Phi_n$, let $A(n)$ denote the greatest absolute value of its coefficients, its height, and let $D(n)$ denote the difference between its largest and smallest coefficients, its diameter. We show that for…

For elliptic curves given by the equation $E_{a}: y^{2}=x^{3}+ax$, we establish the best-possible version of Lang's conjecture on the lower bound of the canonical height of non-torsion points along with best-possible upper and lower bounds…

Let $E$ be an elliptic curve over $Q$, and $\tau$ an Artin representation over $Q$ that factors through the non-abelian extension $Q(\sqrt[p^n]{m},\mu_{p^n})/Q$, where $p$ is an odd prime and $n,m$ are positive integers. We show that…

In this article, we construct algebraic equations for a curve C and a map f to an elliptic curve E, with pre-specified branching data. We do this by determining certain relations that the periods of C and E must satisfy and use these…

We use rational parametrizations of certain cubic surfaces and an explicit formula for descent via 3-isogeny to construct the first examples of elliptic curves E_k: x^3 + y^3 = k of ranks 8, 9, 10, and 11 over Q. As a corollary we produce…

Given an elliptic curve $E$ defined over $\mathbb{Q}$ without complex multiplication, we provide an explicit sharp bound on the index of the image of the adelic representation $\rho_E$. In particular, if $\operatorname{h}_{\mathcal{F}}(E)$…

We construct certain elements in the integral motivic cohomology group $H^3_{{\cal M}}(E \times E',\Q(2))_{\ZZ}$, where $E$ and $E'$ are elliptic curves over $\Q$. When $E$ is not isogenous to $E'$ these elements are analogous to…

We prove a general formula for the $p$-adic heights of Heegner points on modular abelian varieties with potentially ordinary (good or semistable) reduction at the primes above $p$. The formula is in terms of the cyclotomic derivative of a…

We prove quantitative upper bounds for the number of quadratic twists of a given elliptic curve $E/\Fp_q(C)$ over a function field over a finite field that have rank $\geq 2$, and for their average rank. The main tools are constructions and…

Two rational primes p, q are called dual elliptic if there is an elliptic curve E mod p with q points. They were introduced as an interesting means for combining the strengths of the elliptic curve and cyclotomy primality proving…

We give an account of the complex Arithmetic-Geometric Mean (AGM), as first studied by Gauss, together with details of its relationship with the theory of elliptic curves over $\C$, their period lattices and complex parametrisation. As an…

A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer…

The famous theorem of Fritz John states that any convex body has a unique maximal volume inscribed ellipsoid, known as the John Ellipsoid. Computing the John Ellipsoid is a fundamental problem in convex optimization. In this paper, we focus…

Let $\F_p = \Z/p\Z$. The \emph{height} of a point $\mathbf{a}=(a_1,..., a_d) \in \F_p^d$ is $h_p(\mathbf{a}) = \min \left\{\sum_{i=1}^d (ka_i \mod p) : k=1,...,p-1\right\}.$ Explicit formulas and estimates are obtained for the values of the…

Computing the minimum distance of a linear code is one of the fundamental problems in algorithmic coding theory. Vardy [14] showed that it is an \np-hard problem for general linear codes. In practice, one often uses codes with additional…