SIAM Journal on Discrete Mathematics · 2010 · 34 citations · 29 references
Natural SciencesComputer ScienceMathematicsAlgebraBoolean AlgebraYoung Tableaux
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of studying bijections between Young tableaux. Originating in theoretical computer science, these notions allow us to give a unified view of a number of classical bijections and establish formal connections between them.
29
Permutations, matrices, and generalized Young tableaux
Donald Knuth · Pacific Journal of Mathematics · 1970 · 748 citations · Full text
Longest Increasing and Decreasing Subsequences
C. Schensted · Canadian Journal of Mathematics · 1961 · 587 citations · Full text
On the Representations of the Symmetric Group
G. de B. Robinson · American Journal of Mathematics · 1938 · 304 citations