A quasi-linear time algorithm for computing modular polynomials in dimension 2
Number Theory
2019-02-20 v4
Abstract
We propose to generalize the work of R\'egis Dupont for computing modular polynomials in dimension 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.
Keywords
Cite
@article{arxiv.1411.0409,
title = {A quasi-linear time algorithm for computing modular polynomials in dimension 2},
author = {Enea Milio},
journal= {arXiv preprint arXiv:1411.0409},
year = {2019}
}