Hi Mike, Nicolas, Viviane, *, I implemented naive algorithms to do plethysm and change of basis, together with some tests from Lascoux' book. I don't really know what the coproduct should be. I am convinced that one could do much better, but at least it's a start. (I now see that I should probably have looked at the implementation of plethysm in sfa first...)
In particular, one might want to have clever specialisations of alphabets and also finite alphabets -- probably via include and exclude as in the single alphabet case. (I found it slightly curious to discover that p(X-Y) = 1, by the way.) I have absolutely no idea about where to put this in the sources. Help is much appreciated. One other thing: is this actually related to Viviane's work? All the best, Martin -- 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.
alphabets.sage
Description: Binary data
