On Mon, 05 Sep 2011 at 09:59AM -0500, Pedro Sanchez wrote: > Could someone be kind enough to point me in the right direction to > polish and submit a new sage function? > > SAGE already has an implementation of the Robinson-Schensted algorithm > for permutations (bijection between permutations and standard Young > tableaux), which I used as a base to implement the > Robinson-Schensted-Knuth generalization (bijection between nonegative > integer matrices and pairs of semistandard Young tableaux). > > Unfortunately, I don't know how to "add it" to the base Matrix class > (like RS is a method from Permutation class, and I don't know if it > should be desirable since it can't be applied to arbitrary matrices) > nor how or where submit it for consideration.
You should definitely post this to the sage-combinat list: https://groups.google.com/forum/#!forum/sage-combinat-devel (I see someone has already forwarded your message there.) The folks there are working on tableaux and would know where best to put your code. Having the bijection for nonnegative integer matrices would surely be nice to have in Sage. Dan -- --- Dan Drake ----- http://mathsci.kaist.ac.kr/~drake -------
signature.asc
Description: Digital signature
