#
Number theory computer programs

A package of PARI routines to compute Heegner points over ring class
fields of imaginary quadratic fields and
Stark-Heegner points over ring class fields of real quadratic fields, as explained in the
article

H. Darmon and P. Green. *Elliptic curves and class fields of real quadratic fields: algorithms and evidence.* Experimental Mathematics 11:1 (2002) 37-55.

A collection of PARI routines to compute the Mazur-Tate circle pairing,
derived periods, and test a variant of the Birch and Swinnerton-Dyer conjecture
for the Mazur-Tate circle pairing.
These routines were used to gather the numerical data in

M. Bertolini and H. Darmon. *A Birch and Swinnerton-Dyer conjecture
for the Mazur-Tate circle pairing.* Duke Math Journal **122** (2004)
181-204.

This is the software that was used in performing the calculations that
are summarised in

H. Darmon and A. Logan. *
Periods of Hilbert modular forms and rational points on elliptic curves*.
IMRN, ** 40** (2003) 2153-2180.

A collection of Magma programs for computing Stark-Heegner points.
The approach that is followed represents a
significant improvement over the one which is
documented in the earlier article

H. Darmon and P. Green. *Elliptic curves and class fields of real quadratic fields: algorithms and evidence.* Experimental Mathematics 11:1 (2002) 37-55.

The improved algorithm,
based on the notion of *overconvergent modular symbols*
introduced by Stevens and Pollack, is explained in the article

H. Darmon and R. Pollack. *The efficient calculation of Stark-Heegner points via overconvergent modular symbols*.

A collection of Pari programs writtenn by Antoine Gournay to do the Heegner
point calculations that appear in his McGill Masters thesis.