Re: [sage-support] Re: Invariant Polynomes under group action

2011-08-14 Thread Johannes
No, would be nice if there is one, which I just dont know of. There are algorithmic solution for my problem the other way round (given the group G, calculate the invariant ring I). But in my eyes the problem looks not that hard. Most times you see the solution very fast without calcualting anything

[sage-support] Re: Rotate of Bits

2011-08-14 Thread Benjamin Jones
On Aug 13, 3:00 am, Simon King wrote: > Hi Santanu, hi Benjamin, > > On 13 Aug., 06:23, Benjamin Jones wrote: > > > On Aug 12, 9:38 pm, Santanu Sarkar > > See section 5.4.1 of: > > >http://docs.python.org/library/stdtypes.html > > I doubt that that is answering the question: "I have  64 bit in

[sage-support] Re: Invariant Polynomes under group action

2011-08-14 Thread Simon King
Hi Johannes, On 14 Aug., 19:54, Johannes wrote: > Hi list > I have given an Ideal I in the polynomial ring R and I need to know the > minimal group G wich acts on I such that I is the Invariant Ring of R > under the action of G. Just out of curiosity: Do you have a reference for an algorithmic

[sage-support] Invariant Polynomes under group action

2011-08-14 Thread Johannes
Hi list I have given an Ideal I in the polynomial ring R and I need to know the minimal group G wich acts on I such that I is the Invariant Ring of R under the action of G. for example: let R = CC., I the ideal generated by let G \subset SL_3(CC) act by a e_i -> a x_i. If xi is a third primitive

Re: [sage-support] bug in groups.prod?

2011-08-14 Thread Johannes
I got my error, i mixed prod and cartesian_product. Am 14.08.2011 16:50, schrieb Johannes: > Hi list, > i tried to compute the product of two matrix groups and run in a gap > parsing error. > Miniexample: > g1 = MatrixGroup([Matrix(CC,[[1, 0, 0, 0], [0, 1, 0, 0], [0, 0, -1, 0], > [0, 0, 0, 1]])])

[sage-support] bug in groups.prod?

2011-08-14 Thread Johannes
Hi list, i tried to compute the product of two matrix groups and run in a gap parsing error. Miniexample: g1 = MatrixGroup([Matrix(CC,[[1, 0, 0, 0], [0, 1, 0, 0], [0, 0, -1, 0], [0, 0, 0, 1]])]) g2 = MatrixGroup([Matrix(CC,[[1, 0, 0, 0], [0, 1, 0, 0], [0, 0, 1, 0], [0, 0, 0, I]])]) g1.prod(g2) thi

[sage-support] Re: unit roots

2011-08-14 Thread Simon King
Hi Johannes, On 14 Aug., 15:09, Johannes wrote: > I have to deal with unit roots for some calculations. I suppose you mean primitive roots of unity in CC? > And for simplicity > I want to give the n-th unit root a name (lets say xi) instead of > dealing with numeric values. > Up to know I solve

[sage-support] unit roots

2011-08-14 Thread Johannes
Hi list, I have to deal with unit roots for some calculations. And for simplicity I want to give the n-th unit root a name (lets say xi) instead of dealing with numeric values. Up to know I solved this by definig xi to be the solution of $x^n -1 == 0$ for a given $n$ but how can I name a solution o