--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-support+unsubscr...@googlegroups.com.
To post to this group, send email to sage-support@googlegroups.com.
V
OK how about this for a minimal example of unexpected (to me) behaviour. I
get problems with sage 6.4.1 and 7.0.0 with the below code.
G=DirichletGroup(80);
for chi in G:
D=ModularSymbols(chi,2,-1).cuspidal_subspace().new_subspace().decomposition();
for f in D:
e=f.q_eigenform
>
> If you let sage print the alpha^3 coefficient of you see that in both
>> cases it picks a different q_eigenform in f, the Galois conjugacy class of
>> newforms.
>>
>
Are you sure this is what is happening?
Version 7.0.0. When bad code isn't run, good code gives this:
sage: f.q_eigenform(
Hi Misja. Your silly code works fine for me on ubuntu 14.04 with sage
version 6.4.1 (I get zeroes), but I can reproduce your random '1' with sage
7.0.0. I can confirm that after the bad code has run once on 7.0.0, David's
suggestion of clearing the modular symbols cache does not fix the problem
Ooh I'm _really_ glad I asked now. Many thanks William.
The first time I wanted such a loop, I was beta testing your magma modular
symbols code in 2000 or so :-)
Kevin
On Monday, 4 August 2014 15:01:05 UTC+1, William wrote:
>
> On Mon, Aug 4, 2014 at 5:11 AM, Kevin Buzzard > wr
TL;DR: I am going to write a bash loop which loops through 1<=N<=1 and
feeds the number N into a function in a sage session, one session per N.
Has anyone written a robust way of doing this already?
Gory details: I have memory man
Thanks to everyone who commented. I am a fool. I got tangled up in some
similar sort of situation a few months ago and David Loeffler emailed me to
basically warn me off sage's x and to use anything else instead. I didn't
follow his advice this time because I couldn't get an R. constructor to
w
This took me a fair while to track down.
sage:
m=matrix(GF(3),[[0,1,0,0,0,0],[0,0,1,0,0,0],[0,0,0,1,0,0],[0,0,0,0,1,0],[0,0,0,0,0,1],[2,2,0,1,0,0]])
# random 6x6 matrix
sage: g=m.charpoly('x')
sage: g
x^6 + x^3 + 2*x + 2
[I've just build a degree 6 poly. Now let's build a degree 12 one]
sage:
What I am doing wrong here?
I have a file called test.py and it looks like this:
***
def slop(p,e,k):
Gamma=DirichletGroup(p^e)
chi=Gamma.gens()[len(Gamma.gens())-1]
assert chi(-1)==(-1)**k
return chi(-1),(-1)**k
# indicator that I've left a blank line
***
If I cut-and-paste that file int
Thanks William and Nils!
So now I can write better code than yesterday and, as John says, the only
remaining question is how someone with no sage experience is supposed to
work out for themselves that if R is a polynomial ring then R([1,2,3]) is
the way to create 3x^2+2x+1.
Let me stress that I
Thanks William and Niels!
So now I can write better code than yesterday and, as John says, the only
remaining question is how someone with no sage experience is supposed to
work out for themselves that if R is a polynomial ring then R([1,2,3]) is
the way to create 3x^2+2x+1.
Let me stress that
I am new to sage. I am not scared of reading docs for computer programs. I
cannot work out how to answer basic questions I have from the sage docs
though :-( and it's so easy just to ask for help, so here I am.
Here's my question. I have a polynomial with coefficients in a cyclotomic
field and
module and the systems of eigenvalues showing up will be precisely
those coming from the reductions of char 0 newforms. Isn't that the space I
want? How can I compute this space in sage?
Kevin
On Tuesday, 1 April 2014 15:39:24 UTC+1, William wrote:
>
> On Tue, Apr 1, 2014 at 4:05 AM, Kevi
I know too little about what is going on under the hood to write the code I
want to write.
I would like to compute the mod 3 reduction of the char poly of the Hecke
operator T(5) on the space of weight 2 level Gamma_0(N) cuspidal newforms for
all N<=500 (say). This problem might be a bit more s
14 matches
Mail list logo
