#10446: Schuetzenberger Involution
---------------------------------------------+------------------------------
Reporter: ebeyerstedt | Owner: sage-combinat
Type: task | Status: needs_review
Priority: major | Milestone:
Component: combinatorics | Keywords: schuetzenberger,
involution, words
Author: Erin Beyerstedt, Ilke Canakci | Upstream: N/A
Reviewer: Anne Schilling | Merged:
Work_issues: |
---------------------------------------------+------------------------------
Old description:
> Implementation of the schuetzenberger involution on both words and
> tableau.
New description:
Implementation of the schuetzenberger involution on both words and
tableaux.
--
Comment(by aschilling):
Replying to [comment:7 aschilling]:
This looks good and all tests pass! One suggestion I have is that it
should be possible to pass the alphabet underlying a given tableau for the
method schuetzenberger_involution for tableaux. Currently
sage: t = Tableau([[1,1,4],[2]])
sage: t.schuetzenberger_involution()
[[1, 3, 4], [4]]
but if the underlying alphabet is different, the answer would be
different.
This would require to change the method to_word in tableau.py.
Also, for words it would be good to add a test that shows that one can
have repeated letters:
sage: w = Word([2,1,1,4], alphabet=[1,2,3,4,5,6])
sage: w.schuetzenberger_involution()
word: 3665
Thanks so much for your work on this!
Anne
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10446#comment:8>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
