#5551: Permutation from a pair of standard tableaux
---------------------------+------------------------------------------------
Reporter: slabbe | Owner: slabbe
Type: defect | Status: new
Priority: major | Milestone: sage-3.4.1
Component: combinatorics | Keywords: robinson schensted
---------------------------+------------------------------------------------
1. In sage 3.4, the Robinson Schensted algorithm is coded for a
permutation :
{{{
sage: p = Permutation([3, 6, 5, 2, 7, 4, 1])
sage: p.robinson_schensted()
[[[1, 4, 7], [2, 5], [3], [6]], [[1, 2, 5], [3, 6], [4], [7]]]
}}}
Since this algorithm is invertible, it would be nice to allow to construct
a permutation from a pair of standard tableaux of the same shape.
2. The Robinson-Schensted is broken on the empty permutation. It should
simply return a pair of empty tableaux :
{{{
sage: p=Permutation([])
sage: p.robinson_schensted()
Traceback (most recent call last):
...
ValueError: invalid tableau
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5551>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
