Hello Jean, > I recommend in general for such questions, if you want to re-implement all > I have done, that you just read the code of Chevie. I hope it is readable, > and if not please tell me, I will add documentation and give you any > explanations needed.
thanks a lot for all your comments, I will start doing some things in sage while looking into your code! I thought of first having a very general framework: given a classification type return a ComplexReflectionGroup having the basic data and as well a permutation representation and a matrix representation. The first thing I gonna look into your code for is to find a way to get the permutation representation for any complex reflection group. I talked to Vivien Ripol (with whom I share an office in Montreal) and it looks like you defined again a "root system" on which the group acts and which gives the permutation representation? Have you as well implemented the cyclotomics in gap? While implementing them in sage, I found a bug in the gap version (I didn't look for the reason, just some E(n) which are wrong) . I don't have the n here, but I can send it to you when I am in the office... Best regards, Christian -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
