Thanks. I reported this as http://trac.sagemath.org/sage_trac/ticket/3353
On Mon, Jun 2, 2008 at 9:43 PM, Mike Hansen <[EMAIL PROTECTED]> wrote: > > Hello, > > This is definitely not a problem with coercion -- it's a problem with > the iterator for G. For example. try this: > > sage: z = iter(G) > sage: z > <iterator object at 0x3c737d0> > sage: z.next() > [0 1] > [1 0] > sage: z.next() > [0 1] > [1 1] > > It takes quite a bit of time to do each .next() which makes me suspect > that something silly is going on. > > --Mike > > > --Mike > On Mon, Jun 2, 2008 at 5:44 PM, David Joyner <[EMAIL PROTECTED]> wrote: >> >> Hi: >> >> Possibly this is a problem with coercion but I don't know. >> Does anyone know why the following takes so long? >> >> >> sage: p = 5 >> sage: F = GF(p) >> sage: E.<a> = GF(p^2,"a") >> sage: G = GL(2,p) >> sage: M = MatrixSpace(E,2,2) >> sage: V = VectorSpace(E,2) >> sage: g = G.random_element() >> sage: v = V([1,a]); v; g; M(g)*v >> (1, a) >> >> [4 0] >> [2 1] >> (4, a + 2) >> sage: G.order() >> 480 >> sage: time orbit_v = [M(g)*v for g in G] >> >> >> It has not finished after several minutes. It seems like it should be >> instant. >> >> - David Joyner >> >> > >> > > > > --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/sage-support URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
