I try to implement some hopf algebra: - FQSym - WQSym - PQSym - PBT
The 3 firsts are in #13793 (no dependance in combinat) and PBT in #13855 (depends of binary_trees). To build these Hopf algebra, I implemented two new combinatoric objets : PackedWord for WQSym and ParkingFunctions for PQSym. FQSym is clean I think... with some bases. Please comment and help me to improve that. Jean-Baptiste Priez (phd student of F. Hivert and N.M. Thiéry) (Humm... Sorry for my bad english) -- 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/-/onIAGkqsi2IJ. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.
