Travis Scrimshaw <tsc...@ucdavis.edu> writes: > Hey Nathann, > The main reason why I stalled on the permutations input was mainly trying > to figure out how to handle generalized > permutations (a.k.a. bi-words, two-line arrays, in bijection with N-matrices) > so the RS(K) examples will still work (and > as a 2fer, getting the full RSK working), and I wanted to talk in particular > with Nicolas and Florent about how to > structure/refactor everything. The current version of > trac_8392-check_permutation-ts.patch in the sage-combinat queue > currently checks to make sure input is 1 to n, however I can base that patch > on the #13742 patch. I can also get back > immediately into finishing the above patch if you want too.
I think I posted code for growth diagrams once (including all 4 variants of RSK and also domino insertion). In case you are interested, I can repost. 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 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.
