arXiv · 1411.0409
A quasi-linear time algorithm for computing modular polynomials in dimension 2
Abstract
We propose to generalize the work of R\'egis 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.
Explore related subjects
Keep this discovery
Enea Milio. 2014-11-03. A quasi-linear time algorithm for computing modular polynomials in dimension 2. https://doi.org/10.1112/s1461157015000170
Cite the original work for its findings. Save a collection to share your selection of sources.