arXiv:math/0606210 Abstract

arXiv:math/0606210 [math.NT]Abstract References Reviews Resources

Jacobiens, jacobiennes et stabilité numérique

Published 2006-06-09Version 1

This paper is concerned with the complexity and stability of arithmetic operations in the jacobian variety of curves over the field of complex numbers, as the genus grows to infinity. We focus on modular curves. Efficient and stable computation in the jacobian of modular curves is useful for computing coefficients of modular forms in deterministic polynomial time. This work is part of my contribution to Edixhoven's program for solving this problem.

Comments: to appear in Groupe de Galois arithm\'etiques et diff\'erentiels (Luminy, 2004) D. Bertrand, P. D\`ebes (Ed.) S\'eminaires et Congr\`es (2006), Soci\'et\'e Math\'ematique de France

Categories: math.NT

Subjects: 11F11, 11F25, 11F30, 11Y16, 11Y35, 65E05, 65Y20, 68Q15

Keywords: modular curves, jacobiennes, deterministic polynomial time, arithmetic operations, jacobian variety

Related articles: Most relevant | Search more

arXiv:math/0105232 [math.NT] (Published 2001-05-28)

Modular Curves Of Genus 2

Enrique Gonzalez-Jimenez, Josep Gonzalez

arXiv:1807.08777 [math.NT] (Published 2018-07-23)

Two Algorithms to Find Primes in Patterns

Jonathan P. Sorenson, Jonathan Webster

arXiv:1710.10915 [math.NT] (Published 2017-10-30)

Self intersection numbers of minimal, regular models of modular curves $X_0(p^2)$ over rational numbers