Related papers: Computing Canonical Heights on Elliptic Curves in …

We derive a numerical algorithm for evaluating the Riemannian logarithm on the Stiefel manifold with respect to the canonical metric. In contrast to the existing optimization-based approach, we work from a purely matrix-algebraic…

Let $\mathbb{F}$ be the function field of a curve over an algebraically closed field with $\operatorname{char}(\mathbb{F})\ne2,3$, and let $E/\mathbb{F}$ be an elliptic curve. Then for all finite extensions $\mathbb{K}/\mathbb{F}$ and all…

We give an asymptotic formula for the number of elliptic curves over $\mathbb{Q}$ with bounded Faltings height. Silverman has shown that the Faltings height for elliptic curves over number fields can be expressed in terms of modular…

We present a new quadratic Chabauty method to compute the integral points on certain even degree hyperelliptic curves. Our approach relies on a nontrivial degree zero divisor supported at the two points at infinity to restrict the $p$-adic…

Let (X,D) be a projective log pair over the ring of integers of a number field such that the log canonical line bundle K_(X,D) or its dual -K_(X,D) is relatively ample. We introduce a canonical height of K_(X,D) (and -K(X,D)) which is…

We propose an algorithm for classification of linear codes over different finite fields based on canonical augmentation. We apply this algorithm to obtain classification results over fields with 2, 3 and 4 elements.

We find equations for the higher dimensional analogue of the modular curve X_0(3) using Mumford's algebraic formalism of algebraic theta functions. As a consequence, we derive a method for the construction of genus 2 hyperelliptic curves…

We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an isogeny of degree $\ell$ ($\ell$ different from the…

We establish asymptotic lower bounds for the number of elliptic curves over $\mathbb{Q}$ with prescribed entanglement of division fields, ordered by naive height. Such elliptic curves are obtained as $1$-parameter families arising from…

We present an algorithm that, for every fixed genus $g$, will enumerate all hyperelliptic curves of genus $g$ over a finite field $k$ of odd characteristic in quasilinear time; that is, the time required for the algorithm is…

Though quantum algorithm acts as an important role in quantum computation science, not only for providing a great vision for solving classically unsolvable problems, but also due to the fact that it gives a potential way of understanding…

We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…

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…

Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime p and positive integer m=o(sqrt(p)/(log p)^4), outputs an elliptic curve E over the finite field F_p for which the cardinality of E(F_p) is…

A simple algorithm with quasi-linear time complexity and linear space complexity for the evaluation of the hypergeometric series with rational coefficients is constructed. It is shown that this algorithm is suitable in practical informatics…

Let F and G be morphisms of degree at least 2 from P^N to P^N that are defined over the algebraic closure of Q. We define the arithmetic distance d(F,G) between F and G to be the supremum over all algebraic points P of |h_F(P)-h_G(P)|,…

We study canonical heights for plane polynomial mappings of small topological degree. In particular, we prove that for points of canonical height zero, the arithmetic degree is bounded by the topological degree and hence strictly smaller…

A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…

We describe an algorithm to compute the local component at p of the Coleman-Gross p-adic height pairing on divisors on hyperelliptic curves. As the height pairing is given in terms of a Coleman integral, we also provide new techniques to…

We propose several properties of elliptic lifts of the $K$-theoretic canonical bases for conical symplectic resolutions defined in our previous work. As an example, we construct elliptic lifts of canonical bases for the Hilbert scheme of…