×

Computing Néron-Tate heights of points on hyperelliptic Jacobians. (English) Zbl 1239.14019

Let \(C\) be an odd-degree hyperelliptic curve over a number field. The aim of this paper is the practical computation of the Néron-Tate height of a point on the Jacobian of \(C\), by using Arakelov theory (more precisely, the formula of G. Faltings [Ann. Math. (2) 119, 387-424 (1984; Zbl 0559.14005)] and P. Hriljac [Am. J. Math. 107, 23–38 (1985; Zbl 0593.14004)], that expresses this height as the self-intersection of a certain divisor on a regular model of the curve).
Algorithms to compute the different ingredients of that formula are described, and some numerical tests for genus \(1\leq g\leq9\) are presented. For genus \(g>2\) this method seems much more efficient than previous attempts to compute Néron-Tate heights, based on explicit equations for projective embeddings of Jacobians.

MSC:

14G40 Arithmetic varieties and schemes; Arakelov theory; heights
11G30 Curves of arbitrary genus or genus \(\ne 1\) over global fields
11G50 Heights
37P30 Height functions; Green functions; invariant measures in arithmetic and non-Archimedean dynamical systems

Software:

Magma

References:

[1] Bosma, W.; Cannon, J.; Playoust, C., The Magma algebra system. I. The user language, Computational Algebra and Number Theory. Computational Algebra and Number Theory, London, 1993. Computational Algebra and Number Theory. Computational Algebra and Number Theory, London, 1993, J. Symbolic Comput., 24, 3-4, 235-265 (1997) · Zbl 0898.68039
[2] Y. Bugeaud, M. Mignotte, S. Siksek, M. Stoll, Sz. Tengely, Integral points on hyperelliptic curves, preprint, 2010.; Y. Bugeaud, M. Mignotte, S. Siksek, M. Stoll, Sz. Tengely, Integral points on hyperelliptic curves, preprint, 2010.
[3] Cassels, J. W.S.; Flynn, E. V., Prolegomena to a Middlebrow Arithmetic of Curves of Genus 2, London Math. Soc. Lecture Note Ser., vol. 230 (1996), Cambridge University Press: Cambridge University Press Cambridge · Zbl 0857.14018
[4] Faltings, G., Calculus on arithmetic surfaces, Ann. of Math., 119, 2, 387-424 (1984) · Zbl 0559.14005
[5] Flynn, E. V.; Smart, N. P., Canonical heights on the Jacobians of curves of genus 2 and the infinite descent, Acta Arith., 79, 4, 333-352 (1997) · Zbl 0895.11026
[6] Hess, F., Computing Riemann-Roch spaces in algebraic function fields and related topics, J. Symbolic Comput., 33, 425-445 (2002) · Zbl 1058.14071
[7] D. Holmes, Heights on high-genus hyperelliptic curves, University of Warwick PhD thesis, 2012, in preparation.; D. Holmes, Heights on high-genus hyperelliptic curves, University of Warwick PhD thesis, 2012, in preparation.
[8] Hriljac, P., Heights and Arakelovʼs intersection theory, Amer. J. Math., 107, 1, 23-38 (1985) · Zbl 0593.14004
[9] Lang, S., Fundamentals of Diophantine Geometry (1983), Springer-Verlag: Springer-Verlag New York · Zbl 0528.14013
[10] Lang, S., Introduction to Arakelov Theory (1988), Springer · Zbl 0667.14001
[11] Liu, Q., Algebraic Geometry and Arithmetic Curves, Oxf. Grad. Texts Math., vol. 6 (2002), Oxford University Press: Oxford University Press Oxford, Translated from French by Reinie Erné, Oxford Science Publications · Zbl 0996.14005
[12] Mumford, D.; Musili, C., Tata Lectures on Theta: Jacobian Theta Functions and Differential Equations (1984), Springer · Zbl 0549.14014
[13] Mueller, J. S., Computing canonical heights using arithmetic intersection theory (2011), eprint
[14] Mumford, D., Tata Lectures on Theta I (1983), Birkhäuser · Zbl 0509.14049
[15] Pauli, S.; Roblot, X. F., On the computation of all extensions of a p-adic field of a given degree, Math. Comp., 70, 236, 1659 (2001) · Zbl 0981.11038
[16] Stubbs, A. G.J., Hyperelliptic Curves (2001)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.