Abstract
AbstractWe develop a new p-adic algorithm to compute the minimal polynomial of a class invariant. Our approach works for virtually any modular function yielding class invariants. The main algorithmic tool is modular polynomials, a concept which we generalize to functions of higher level.
Subject
Computational Theory and Mathematics,General Mathematics
Reference24 articles.
1. Elliptic Functions
2. Diophantine Geometry
3. [22] Sutherland A. V. , ‘Computing Hilbert class polynomials with the Chinese remainder theorem’ Math. Comp., to appear, available at http://arxiv.org/abs/0903.2785.
4. Modular curves of composite level
5. The complexity of class polynomial computation via floating point approximations
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献