Hi David, I've managed to run the program with modular symbols and get the same results faster. I think now the only problematic step is the decomposition. As this involves manipulating large matrices, it is both slow and memory-consuming. Do you know of any way to improve speed and/or memory efficiency in this step?
Thanks, Sam On Thursday, 21 June 2012 17:19:18 UTC+10, David Loeffler wrote: > > On 21 June 2012 01:01, Sam Chow <[email protected]> wrote: > > Dear David, > > > > The Sturm bound tells us how many coefficients we need to check before > we > > know that two modular forms are the same (if the first B Fourier > > coefficients are the same then they're all the same). Maeda's conjecture > > tells us that we only need to check two coefficients in level 1 > (otherwise > > the Hecke polynomial has a repeated eigenvalue, contradiction). > > (BTW, the Sturm bound works for any forms, not just eigenforms, while > the thing with Maeda's conjecture is really specific to eigenforms.) > > If that's what you had in mind, you might find it easier and quicker > to work with cuspidal modular *symbols* (which are vastly quicker to > compute, and which have the same Hecke eigenvalues as cusp forms). > > Regards, David > -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
