On the Computational Complexity of Modular Symbols

DOI10.2307/2153219zbMATH Open0770.11026OpenAlexW4240274310MaRDI QIDQ4024693FDOQ4024693

Authors: Dorian Goldfeld 

Publication date: 10 February 1993

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

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

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)

Cites Work

• Hecke operators on \(\Gamma_0(m)\)
• On the factors of the Jacobian variety of a modular function field
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (15)

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

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)