Article contents
A quasi-linear time algorithm for computing modular polynomials in dimension 2
Published online by Cambridge University Press: 01 September 2015
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 invariants derived from theta constants and prove heuristically 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.
MSC classification
- Type
- Research Article
- Information
- Copyright
- © The Author 2015
References
![](https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20160921005734476-0776:S1461157015000170:S1461157015000170_inline2.gif?pub-status=live)
- 7
- Cited by