Class polynomials for nonholomorphic modular functions

Class polynomials for nonholomorphic modular functions
复制标题

非全纯模函数的类多项式

DOI:
10.1016/j.jnt.2015.07.002
复制
发表时间:
2013
影响因子:
0.7
通讯作者:
Andrew V. Sutherland
Andrew V. Sutherland
中科院分区:
数学3区
文献类型:
--
作者:
J. Bruinier;K. Ono;Andrew V. Sutherland

文献摘要

参考文献

被引文献

相似文献

我们给出了计算合适的非全纯模函数F(z)的奇异模的算法。通过将等熵火山理论与Masser关于非全纯Eisenstein级数E2 ∈(z)的一个漂亮的观察相结合,我们得到了计算类多项式H D(F; x)的基于CRT的算法,其根是F(z)的判别D奇异模.通过将这些结果应用于一个特定的弱Maass形式F p(z),我们得到了一个基于CRT的计算划分类多项式的算法,划分类多项式是一列多项式,其迹给出了划分数p(n).在GRH下,该算法的期望运行时间为O(n5/2+ o(1)).这些结果的关键是一个快速的CRT为基础的算法计算经典的模多项式Φ m(X,Y),我们通过扩展以前开发的素数的m的Islam火山方法获得。
We give algorithms for computing the singular moduli of suitable nonholomorphic modular functions F (z). By combining the theory of isogeny volcanoes with a beautiful observation of Masser concerning the nonholomorphic Eisenstein series E 2⁎(z), we obtain CRT-based algorithms that compute the class polynomials H D (F; x), whose roots are the discriminant D singular moduli for F (z). By applying these results to a specific weak Maass form F p (z), we obtain a CRT-based algorithm for computing partition class polynomials, a sequence of polynomials whose traces give the partition numbers p (n). Under the GRH, the expected running time of this algorithm is O (n 5/2+ o (1)). Key to these results is a fast CRT-based algorithm for computing the classical modular polynomial Φ m (X, Y) that we obtain by extending the isogeny volcano approach previously developed for prime values of m.
Hardy-Ramanujan-Rademacher 公式的高效实施
DOI: 10.1112/s1461157012001088
发表时间: 2012
影响因子: --
作者:
Johansson F
通讯作者: Johansson F
DOI: 10.1016/j.aim.2013.05.028
发表时间: 2013
影响因子: 1.7
作者:
J. H. Bruinier;K. Ono
通讯作者: K. Ono