Abstract
Schensted algorithm was first described in 1938 by Robinson [5], in a paper dealing with an attempt to prove the correctness of the Littlewood-Richardson rule. Schensted [9] rediscovered Schensted algorithm independently in 1961 and Viennot [12] gave a geometric interpretation for Schensted algorithm in 1977. In this paper we describe some properties of Schensted algorithm using Viennot's geometric interpretation.
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.
