On the computation of the modular equation
From MaRDI portal
\textit{N. Yui} [J. Reine Angew. Math. 299/300, 185-200 (1978; Zbl 0368.14012)] outlined a method for determining the modular polynomial \(\Phi_n(X,J)\) when \(n\) is a prime. The authors extended Yui's method when \(n\) is the square of a prime [Rocky Mt. J. Math. 31, 185-195 (2001; Zbl 0998.11020)], and in this paper they give an elaborate algorithm that works for all prime powers. The method is illustrated with the case \(n=16\).
Recommendations
Cited in
(16)- Computation of the modular equation
- An algorithm for numerically inverting the modular \(j\)-function
- Computing the permanent modulo a prime power
- Two remarks on the modular polynomial of j(z)
- On the evaluation of modular polynomials
- scientific article; zbMATH DE number 4134145 (Why is no real title available?)
- How Branching Properties Determine Modular Equations
- Computing coefficients of modular forms
- scientific article; zbMATH DE number 4202373 (Why is no real title available?)
- scientific article; zbMATH DE number 5005627 (Why is no real title available?)
- scientific article; zbMATH DE number 5509903 (Why is no real title available?)
- Spontaneous generation of Hilbert modular functions
- scientific article; zbMATH DE number 1057052 (Why is no real title available?)
- scientific article; zbMATH DE number 2092278 (Why is no real title available?)
- Algorithmic Number Theory
- On explicit formulas for the modular equation
This page was built for publication: On the computation of the modular equation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778290)
