Weak and strong tableaux correspond to chains in the weak and strong orders and we require that the restriction to entries <= i is a (k+1)-core (or k-bounded partition).
I am suggesting that WeakTableaux input as follows WeakTableaux( k, [outer_shape, inner_shape], weight ) e.g. WeakTableaux( 2, [[3,1],[1]], [2] ) represents the WeakTableaux of shape [3,1]/[1] and weight=[2] OR if the tableaux are not skew... WeakTableaux( k, shape, weight ) e.g. WeakTableaux( 2, [3,1], [3] ) represents the WeakTableaux of shape [3,1] and weight=[3] I am doing the same for StrongTableaux. I however noticed that this one change seemed cause a large slowdown and I am not sure why. -Mike On Saturday, 13 July 2013 14:42:39 UTC-4, darijgrinberg wrote: > > Hi Anne, > > sorry, I should have been more clear. Are you planning to design > classes for general tableaux (like [[None,3,1],[None,2]]) or only > semistandard ones? I'm not sure if those have any weak/strong analoga, > so this might fall outside of your scope... > > Best regards, > Darij > -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-combinat-devel. For more options, visit https://groups.google.com/groups/opt_out.
