Hi Nicolas, On Dec 9, 11:11 am, "Nicolas M. Thiery" <nicolas.thi...@u-psud.fr> wrote: > Just an algorithmic suggestion: what about building the conjugacy > class recursively by conjugating by generators? This is a one liner > with TransitiveIdeal; and roughly speaking, writing C the resulting > conjugacy class, that would make the complexity O(|C|.|G.gens()|) > instead of O(|G|).
This is a very nice idea! I didn't know about TransitiveIdeal (although to be honest, I put almost no thought in the naive method as I was more focused on making the GAP wrapper work properly). I will include your suggestion in my patch! Cheers, Javier -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
