sage: G = libgap.AlternatingGroup(5) sage: chi = G.Irr()[1] sage: libgap.MolienSeries(chi) ( 1-z^2-z^3+z^6+z^7-z^9 ) / ( (1-z^5)*(1-z^3)*(1-z^2)^2 )
On Saturday, August 27, 2016 at 11:00:23 PM UTC+2, saad khalid wrote: > > Also, on the matter on efficiency, I believe Dima mentioned a few months > ago in a post that GAP is far better at computing the molien series of > groups(which is exactly what I'm trying to do here). However, I couldn't > figure out how to do that in Sage. How do I generate a group in GAP and > calculate it's molien series, like I did in my above M2/Sage code? What I > need to do for my project is compile a list of all the molien series of all > the possible groups for a certain root of unity. So like, the matrices in > my group are 3x3, I was thinking that I would have 3 levels of nested > loops, where each would vary the exponent on zet up to the root of unity. > So, for example if I'm doing a 20th root of unity, it would be something > like (psuedocode): > -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
