04 I get
>
> True
> True
> True
> False
> True
> True
> True
> True
> True
> True
> True
> True
> True
> True
> True
> True
> False
> True
> True
> True
> False
> True
> False
>
> Have I misunderstood something or is this a bug
Interesting... Just to confirm: in the above I have been using SageMath
Version 7.1 on Ubuntu 14.04 (sorry, I should have probably stated this way
back when I posted the question). So it seems like it is a Sage 7.0+
problem!
On 3 May 2016 at 16:23, Kevin Buzzard wrote:
> Hi Misja. Your si
ther (i.e. non-modular symbols) caching
problem?
Misja
On Tuesday, 3 May 2016 13:08:29 UTC+1, David Loeffler wrote:
>
> What happens if you run the bad code, then run
> "ModularSymbols_clear_cache()", then the good code? Do you get the same
> discrepancy?
>
> David
>
&g
Thank you very much! I didn't know sage-nt existed :-)
Misja
On Thursday, 28 April 2016 15:13:20 UTC+1, John Cremona wrote:
>
> I have forwarded your question to sage-nt@googlegroups since there are
> people who read that who may be able to answer yet do not read
> sage-suppor
When understand the specific reason why my code is not working properly, I
managed to pin it down to the following mysterious behaviour of q_eigenform.
First run the following code in sage.
G=DirichletGroup(80);
chi=G[22];
D=ModularSymbols(chi,2,-1).cuspidal_subspace().new_subspace().decompositi
On the contrary: it is a helpful remark! I hadn't realised this before. At
least I can check whether I am lucky and the order is of the form Z[X]/(f)
and proceed very quickly if so :-)
On Saturday, 26 March 2016 14:54:00 UTC, David Loeffler wrote:
>
> Dear Misja,
>
> What
g like EquationOrder(K.defining_polynomial(),'alpha'), take a
p-maximal order there and then do what you are suggesting? Although,
actually, I don't know if sage can calculate a p-maximal order of a given
order.
Misja
On Thursday, 17 March 2016 15:50:59 UTC, David Loeffler wrote:
>
&
For a number field N I am trying to factor an integral prime p in a
p-maximal order Op. In the end I would like a map from the quotient of the
p-maximal order Op/P (for P|p) to some finite field in Sage's standard
finite field form, but I can't quite figure out how to do it.
Firstly, Sage doesn
Dear All,
I've been having some issues with Sage's new_subspace() function. Mainly,
it seems to be very, very slow.
For example, in the following example
C=ModularForms(DirichletGroup(10)[1],13).cuspidal_subspace();
N=C.new_subspace();
The second line takes about 28 s to run on my laptop. In
That's great! Thank you for your quick reply :-)
On Sunday, 14 February 2016 15:20:53 UTC, William wrote:
>
> On Sun, Feb 14, 2016 at 6:55 AM, Misja >
> wrote:
> > In Magma there exists a Reductions(f,p) command, which for any modular
> form
> > f defined ove
In Magma there exists a Reductions(f,p) command, which for any modular form
f defined over a number field K and a prime P, outputs all the ''f mod P''
reductions for primes P of O_K s.t. P|p.
For the Magma function see:
https://magma.maths.usyd.edu.au/magma/handbook/text/1552#17206
Does anyo
11 matches
Mail list logo
