Translator Disclaimer
2016 Canonical heights on genus-2 Jacobians
Jan Müller, Michael Stoll
Algebra Number Theory 10(10): 2153-2234 (2016). DOI: 10.2140/ant.2016.10.2153

Abstract

Let K be a number field and let CK be a curve of genus 2 with Jacobian variety J. We study the canonical height ĥ: J(K) . More specifically, we consider the following two problems, which are important in applications:

  1. for a given P J(K), compute ĥ(P) efficiently;

  2. for a given bound B > 0, find all P J(K) with ĥ(P) B.

We develop an algorithm running in polynomial time (and fast in practice) to deal with the first problem. Regarding the second problem, we show how one can tweak the naive height h that is usually used to obtain significantly improved bounds for the difference h ĥ, which allows a much faster enumeration of the desired set of points.

Our approach is to use the standard decomposition of h(P) ĥ(P) as a sum of local “height correction functions”. We study these functions carefully, which leads to efficient ways of computing them and to essentially optimal bounds. To get our polynomial-time algorithm, we have to avoid the factorization step needed to find the finite set of places where the correction might be nonzero. The main innovation is to replace factorization into primes by factorization into coprimes.

Most of our results are valid for more general fields with a set of absolute values satisfying the product formula.

Citation

Download Citation

Jan Müller. Michael Stoll. "Canonical heights on genus-2 Jacobians." Algebra Number Theory 10 (10) 2153 - 2234, 2016. https://doi.org/10.2140/ant.2016.10.2153

Information

Received: 31 March 2016; Revised: 2 August 2016; Accepted: 5 September 2016; Published: 2016
First available in Project Euclid: 16 November 2017

zbMATH: 1383.11089
MathSciNet: MR3582017
Digital Object Identifier: 10.2140/ant.2016.10.2153

Subjects:
Primary: 11G50
Secondary: 11G10, 11G30, 14G05, 14G40, 14Q05

Rights: Copyright © 2016 Mathematical Sciences Publishers

JOURNAL ARTICLE
82 PAGES


SHARE
Vol.10 • No. 10 • 2016
MSP
Back to Top