Transportable Modular Symbols and the Intersection Pairing

Authors:
Helena A. Verrill
Affiliations:
-
Venue:
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Year:
2002

Citing 4
Cited 0

Algorithms for modular elliptic curves

Algorithms for modular elliptic curves
The MAGMA algebra system I: the user language

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Empirical evidence for the Birch and Swinnerton-Dyer conjectures for modular Jacobians of genus 2 curves

Mathematics of Computation
Component Groups of Quotients of J0(N)

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Transportable modular symbols were originally introduced in order to compute periods of modular forms [18]. Here we use them to give an algorithm to compute the intersection pairing for modular symbols of weight k 驴 2. This generalizes the algorithm given by Merel [13] for computing the intersection pairing for modular symbols of weight 2.We also define a certain subspace of the space of transportable modular symbols, and give numerical evidence to support a conjecture that this space should replace the usual space of cuspidal modular symbols.