Abstract
Schensted [ Canad. J. Math. 13 (1961)] constructed an algorithm giving a bijective correspondence between permutations and pairs of Young Tableaux. The author develops an analogous algorithm relating permutations and triples consisting of two Shifted Tableaux and a set. Various properties of this algorithm are also examined.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
