Coleman Integration for Even Degree Models of Hyperelliptic Curves
نویسنده
چکیده
The Coleman integral is a p-adic line integral that encapsulates various quantities of number theoretic interest. Building on the work of Harrison [8], we extend the Coleman integration algorithms in [2] to even degree models of hyperelliptic curves. We illustrate our methods with numerical examples computed in Sage.
منابع مشابه
Explicit Coleman Integration for Hyperelliptic Curves
Coleman’s theory of p-adic integration figures prominently in several number-theoretic applications, such as finding torsion and rational points on curves, and computing p-adic regulators in K-theory (including p-adic heights on elliptic curves). We describe an algorithm for computing Coleman integrals on hyperelliptic curves, and its implementation in Sage.
متن کاملIterated Coleman Integration for Hyperelliptic Curves
The Coleman integral is a p-adic line integral. Double Coleman integrals on elliptic curves appear in Kim’s nonabelian Chabauty method, the first numerical examples of which were given by the author, Kedlaya, and Kim [3]. This paper describes the algorithms used to produce those examples, as well as techniques to compute higher iterated integrals on hyperelliptic curves, building on previous jo...
متن کاملExplicit p-adic methods for elliptic and hyperelliptic curves
We give an overview of some p-adic algorithms for computing with elliptic and hyperelliptic curves, starting with Kedlaya’s algorithm. While the original purpose of Kedlaya’s algorithm was to compute the zeta function of a hyperelliptic curve over a finite field, it has since been used in a number of applications. In particular, we describe how to use Kedlaya’s algorithm to compute Coleman inte...
متن کاملMost Odd Degree Hyperelliptic Curves Have Only One Rational Point
Consider the smooth projective models C of curves y = f(x) with f(x) ∈ Z[x] monic and separable of degree 2g + 1. We prove that for g ≥ 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower bound on this fraction that tends to 1 as g → ∞. Finally, we show that C(Q) can be algorithmically computed for such a fraction of the curves. The method can b...
متن کاملAn Index Calculus Algorithm for Plane Curves of Small Degree
We present an index calculus algorithm which is particularly well suited to solve the discrete logarithm problem (DLP) in degree 0 class groups of curves over finite fields which are represented by plane models of small degree. A heuristic analysis of our algorithm indicates that asymptotically for varying q, “almost all” instances of the DLP in degree 0 class groups of curves represented by pl...
متن کامل