A quasi-linear time algorithm for computing modular polynomials in dimension 2

Q1 Mathematics

Lms Journal of Computation and Mathematics Pub Date : 2014-11-03 DOI:10.1112/S1461157015000170

E. Milio

引用次数: 19

Abstract

We propose to generalize the work of Regis Dupont for computing modular polynomials in dimension $2$ to new invariants. We describe an algorithm to compute modular polynomials for any invariants derived from theta constants and prove that this algorithm is quasi-linear.Some properties of the modular polynomials with the quotient of theta constants are analyzed.We report on experiments with our implementation.

查看原文本刊更多论文

二维模多项式的拟线性时间算法

我们提出将Regis Dupont关于计算2维模多项式的工作推广到新的不变量。描述了一种计算由常数导出的任意不变量的模多项式的算法，并证明了该算法是拟线性的。分析了常数为商的模多项式的一些性质。我们报告了我们实施的实验。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Lms Journal of Computation and Mathematics MATHEMATICS, APPLIED-MATHEMATICS

CiteScore

2.60

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： LMS Journal of Computation and Mathematics has ceased publication. Its final volume is Volume 20 (2017). LMS Journal of Computation and Mathematics is an electronic-only resource that comprises papers on the computational aspects of mathematics, mathematical aspects of computation, and papers in mathematics which benefit from having been published electronically. The journal is refereed to the same high standard as the established LMS journals, and carries a commitment from the LMS to keep it archived into the indefinite future. Access is free until further notice.