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

Abstract : 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 any invariants derived from theta constants and prove that this algorithm is quasi-linear.Some properties of the modular polynomials with the quotient of theta constants are analyzed.We report on experiments with our implementation.
Document type :
Preprints, Working Papers, ...
Domain :

https://hal.archives-ouvertes.fr/hal-01080462
Contributor : Enea Milio <>
Submitted on : Thursday, November 6, 2014 - 9:06:06 AM
Last modification on : Thursday, November 27, 2014 - 1:03:21 AM
Long-term archiving on: : Saturday, February 7, 2015 - 10:16:16 AM

### File

QuasiLinAlgModPol.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-01080462, version 1

### Citation

Enea Milio. A quasi-linear algorithm for computing modular polynomials in dimension 2. 2014. ⟨hal-01080462v1⟩

Record views