Short version: no but with implementation caveats. Longer version: It gores through generic tensor product code:
sage: s = SymmetricFunctions(QQ).s() sage: s2 = tensor([s, s]) sage: s2.__class__ <class 'sage.combinat.free_module.CombinatorialFreeModule_Tensor_with_category'> In order to have it return partition tuples (which didn't exist at the time this was written either), there would need to be at least a little work done. Nobody has had an interest in doing it as nobody has seen a benefit for it. However, I am +1 for the change provided it doesn't slow things down significantly (note that hashing, construction of the elements, and comparisons are done a lot in manipulating the elements in the tensor algebra). Best, Travis On Saturday, August 27, 2022 at 4:24:18 AM UTC+9 axio...@yahoo.de wrote: > > Is there any good reason that the basis keys in tensor products of > symmetric functions are tuples of partitions and not `PartitionTuples`? > > Martin > > sage: h = SymmetricFunctions(QQ).h() > sage: t = tensor([3*h[3], 11*h[1,1]+2*h[2]]) > sage: t > 33*h[3] # h[1, 1] + 6*h[3] # h[2] > sage: [(mu, c) for mu, c in t] > [(([3], [1, 1]), 33), (([3], [2]), 6)] > sage: type(_[0][0]) > <class 'tuple'> > -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-devel/467b33de-1359-4b91-aea7-a3258a8f0a34n%40googlegroups.com.
