#14641: Does the "promotion" method for tableaux really compute Schuetzenberger
promotion?
----------------------------------------------------------------------------+
Reporter: darij |
Owner: tbd
Type: defect |
Status: new
Priority: major |
Milestone: sage-5.11
Component: PLEASE CHANGE |
Resolution:
Keywords: tableaux, partitions, combinat, jeu de taquin, promotion |
Work issues:
Report Upstream: N/A |
Reviewers:
Authors: |
Merged in:
Dependencies: |
Stopgaps:
----------------------------------------------------------------------------+
Comment (by darij):
There's still something I don't like:
{{{
for c in self.cells_containing(n+1):
p = p._slide_up(c)
}}}
This is from the source code of {{{promotion}}}. But sliding up cells
containing the maximum entry in a semistandard tableau is not commutative:
{{{
sage: t = Tableau([[1,2,2,3],[2,3,3]])
sage: t._slide_up((0,3))._slide_up((1,2))
[[0, 1, 2, 2], [0, 2, 3]]
sage: t._slide_up((1,2))._slide_up((0,3))
[[0, 0, 1, 2], [2, 2, 3]]
}}}
Obviously the method is meant for some specific cases in which this
doesn't go wrong, but I'd like to see that in the doc...
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14641#comment:4>
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 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-trac.
For more options, visit https://groups.google.com/groups/opt_out.