A quasi-linear time algorithm for computing modular polynomials in dimension 2 - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue LMS Journal of Computation and Mathematics Année : 2015

A quasi-linear time algorithm for computing modular polynomials in dimension 2

Résumé

We propose to generalize the work of Régis Dupont for computing modular polynomials in dimension 2 to new invariants. We describe an algorithm to compute modular polynomials for invariants derived from theta constants and prove under some heuristics that this algorithm is quasi-linear in its output size. Some properties of the modular polynomials defined from quotients of theta constants are analyzed. We report on experiments with our implementation.
Fichier principal
Vignette du fichier
QuasiLinAlgModPol-Version 2.pdf (465.39 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01080462 , version 1 (06-11-2014)
hal-01080462 , version 2 (26-11-2014)
hal-01080462 , version 3 (02-07-2015)

Licence

Copyright (Tous droits réservés)

Identifiants

  • HAL Id : hal-01080462 , version 3

Citer

Enea Milio. A quasi-linear time algorithm for computing modular polynomials in dimension 2. LMS Journal of Computation and Mathematics, 2015, 18, pp.603-632. ⟨hal-01080462v3⟩
366 Consultations
238 Téléchargements

Partager

Gmail Facebook X LinkedIn More