> \fix(F\square G)[n_1, n_2, \dots] > > is > > coefficient(cycleIndexSeries$F, cycleTypeSpecies [n1, n2,...])
I think, it would have saved me all the trouble if you had given that from the beginning. Being not a combinatorialist, I had problems in seeing that (or better in remembering that) ((G[\sigma])_1, (G[\sigma])_2, ..., (G[\sigma])_n) is equal ((G[\tau ])_1, (G[\tau ])_2, ..., (G[\tau ])_n) if (\sigma_1, \sigma_2, ...) = (\tau_1, \tau_2, ...) This is what removes the sum over permutations. The rest is then as you or BLL described. > (I'm not sure what coefficient(cycleIndexSeries$F, ...) does exactly. If you > include the denominator 1^n1 n1! 2^n2 n2! ... in the coefficient you have to > multiply by it again... The same remark holds for the computation of > cycleTypeSpecies) Well at the moment, there is neither an appropriate "coefficient" function nor a "count" function, because I had no urgent need for it and since coefficient: (%, I) -> P is inherited from FormalPowerSeries(P) where P is the polynomial domain Q[x1,x2,x3,...]. I'll add a new "count" and "coefficient" function that can extract the coefficient according to the cycletype. Thank you for not giving up on me. I'll include functorialCompose for CIS as soon as possible. Ralf ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys-and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Aldor-combinat-devel mailing list Aldor-combinat-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/aldor-combinat-devel
