On the Computational Complexity of Modular Symbols

DOI10.2307/2153219MaRDI QIDQ4024693zbMATH OpenOpenAlexFDO

Authors Dorian Goldfeld

Publication date 10 February 1993

Full work available at URL https://doi.org/10.2307/2153219

zbMATH Keywords

fast algorithmsperiod integralspolynomial time algorithmsgeodesic linescomputation of modular symbols

Mathematics Subject Classification ID

Special values of automorphic (L)-series, periods of automorphic forms, cohomology, modular symbols (11F67) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Computational Aspects of Modular Forms and Galois Representations
• scientific article; zbMATH DE number 1302465
• Cuspidal Modular Symbols are Transportable
• Computing modular degrees using \(L\)-functions
• Modular forms, a computational approach. With an appendix by Paul E. Gunnells

Cites work

• scientific article; zbMATH DE number 4177253 (Why is no real title available?)
• scientific article; zbMATH DE number 3349944 (Why is no real title available?)
• scientific article; zbMATH DE number 3384173 (Why is no real title available?)
• Hecke operators on \(\Gamma_0(m)\)
• On the factors of the Jacobian variety of a modular function field

Cited in

(15)

• Rapid computation of \(L\)-functions for modular forms
• On \(L\)-functions of quadratic \(\mathbb{Q}\)-curves
• ON BINARY QUADRATIC FORMS AND THE HECKE GROUPS
• On the computation of modular forms on noncongruence subgroups
• scientific article; zbMATH DE number 7561747 (Why is no real title available?)
• Numerical modular symbols for elliptic curves
• A fast algorithm to compute \(L(1/2, f\times \chi_q)\)
• Computational arithmetic of modular forms
• scientific article; zbMATH DE number 2086887 (Why is no real title available?)
• Cuspidal Modular Symbols are Transportable
• An introduction to computing modular forms using modular symbols
• Approximate computations with modular curves
• Upper bounds for the size and the depth of formulae for MOD-functions
• Fast evaluation of modular functions using Newton iterations and the AGM
• Application of symbolic manipulation to the Hecke transformations of modular forms in two variables. II

This page was built for publication: On the Computational Complexity of Modular Symbols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024693)