Thanks for your quick response. > > I assume you mean: > > sage: R in Rings() > False >
Yes! > > > I guess all that needs to be implemented is the character table for > general semigroups, that is the change of basis from the C basis (the > analogue of the p basis of symmetric functions in the case of the > symmetric group; name to be discussed!) to the S basis (the analogue > of the s basis) in the character ring. Of course for groups this > should be just asking GAP. > > Then, the product would be easily implemented: it's just the hadamard > product in the C basis, and can be obtained on the S basis by changing > back and forth. > That makes sense. > > Again: the current infrastructure is designed to be flexible, but is > experimental. In particular it's subject to some changes soon when > I'll be done with the functorial construction patch (which raised > interesting -but time consuming- theoretical discussions; but that's > another story). > > I am working with a PermutationGroup G. I want to be able to write R = CharacterRing(G) or R = G.character_ring(ZZ) so that R in Rings() returns True. If I write c = G.character(v) for an appropriate v then all the arithmetic operations on c work fine. I could probably then make this into an implementation of a ring (although I just tried and got confused). However this strikes me as somewhat muddled. -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To view this discussion on the web visit https://groups.google.com/d/msg/sage-combinat-devel/-/T62IznhIoLoJ. 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.
