It is a theorem
[KL89,KL92]
that
is finite, but
very little work has been done on the explicit formula
for
, especially in the case when
. In [KL92, §1.6]
Kolyvagin and Logachev say that if one were able with a compute
the height of a certain Heegner point, their methods could
be used to give a bound on
. This we have not done,
and to the best of our knowledge nobody has done this for any abelian
variety
with
.
Upon learning of [CM], we had the idea to prove in
some cases that
is at least as big as predicted by the
Birch and Swinnerton-Dyer conjecture by turning Mazur's idea of
visibility on its head. Instead of assuming that
is
as predicted by the conjecture
and trying to understand whether or not it is visible in
, we
instead proved the main theorem of [AS02b],
which allowed us to sometimes construct the odd part of
without assuming any conjectures.
After developing algorithms that allow us to compute
the conjectural order of
in most cases, we analyzed the
abelian varieties
of level
, and constructed
the tables of Section 5. This resulted in the first
systematic experimental evidence for the Birch and Swinnerton-Dyer
conjecture for modular abelian varieties of dimension
(see
[FpS+01] for dimension
).
This paper is organized as follows. In Section 2
we review background about modular abelian varieties
and state the Birch and Swinnerton-Dyer conjecture.
Section 3 explains the basic facts about
quotients
of
that one needs to know in order to
compute with them. In Section 4
we discuss a generalization of the Manin constant,
derive a formula for the ratio
,
and bound the denominator of this ratio.
Section 5 reports on our construction
of a table of
rank 0 abelian
varieties
of level
such that the Birch and Swinnerton-Dyer conjecture predicts that
is divisible by an odd prime, and discusses
what we computed to show that for
of the
there
are at least as many elements of the odd part of
as predicted.
Acknowledgment. It is a pleasure to thank Birch, Coleman, Gross, Lenstra, Lorenzini, Merel, Poonen, Ribet, and Tate for many helpful comments and discussions. Special thanks go to Barry Mazur for guiding our ideas on visibility and purchasing the second author a powerful computer, and to Allan Steel and David Kohel at MAGMA for their crucial computational support.