Schensted algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Proper noun[edit]

Schensted algorithm

  1. (mathematics) The simplest description of the Robinson-Schensted correspondence; a procedure that constructs one tableau by successively inserting the values of the permutation according to a specific rule, while the other tableau records the evolution of the shape during construction.