[sage-nt] modular symbols / modular forms

2016-09-17 Thread Jonathan Bober
What is going on with the timings in the following examples? sage: S = CuspForms(1728, 2) sage: %time f = S.hecke_polynomial(2) CPU times: user 17276.68 s, sys: 13.46 s, total: 17290.14 s Wall time: 17293.59 s sage: f x^253 + x^251 - 2*x^249 (Meanwhile, in a separate Sage session...) sage:

Re: [sage-nt] CONDITIONALLY BOUNDING ANALYTIC RANKS OF ELLIPTIC CURVES

2017-03-31 Thread Jonathan Bober
, but that's not anything I'm going to work on anytime soon. It shouldn't be too hard to write something simple. On Thu, Mar 30, 2017 at 4:28 PM, <benyamingholam...@gmail.com> wrote: > there is an article written by jonathan bober for conditionally upper > bound for rank of elliptic c