Skip to search formSkip to main contentSkip to account menu

Robinson–Schensted correspondence

Known as: Robinson correspondence, Robinson–Schensted algorithm, Robinson-Schensted correspondence 
In mathematics, the Robinson–Schensted correspondence is a bijective correspondence between permutations and pairs of standard Young tableaux of the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In his study of Kazhdan–Lusztig cells in affine type A, Shi has introduced an affine analog of Robinson–Schensted correspondence… 
2013
2013
We prove a limit shape theorem describing the asymptotic shape of bumping routes when the Robinson–Schensted algorithm is applied… 
2011
2011
The study addresses a problem which is inadequately investigated in second language acquisition research, that is, personality… 
2007
2007
In this paper, we develop the Robinson-Schensted correspondence for the signed Brauer algebra. The Robinson-Schensted… 
Highly Cited
1996
Highly Cited
1996
SummaryIn analogy to the well-known tilings of the euclidean plane $$\mathbb{E}^2 $$ by Penrose rhombs (or, to be more precise… 
Highly Cited
1995
Highly Cited
1995
We discuss the Robinson-Schensted and Schutzenberger algorithms, and the fundamental identities they satisfy, systematically…