Young Tableaux
Young Tableaux is a combinatorial structure consisting of a Young diagram (the Ferrers diagram of a partition) whose boxes are filled with entries from a totally ordered alphabet, typically the positive integers, to form arrays that encode and index representations, especially of the symmetric and general linear groups.
228
Publications
11.1K
Citations
274
Authors
215
Institutions
Publications per year
2017–2026
25
228
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
A variational problem for random Young tableaux
Bill Logan, L. A. Shepp · Advances in Mathematics · 1977 · 557 citations
1–5 of 228
274
10
h-index
6
h-index
6
h-index
University of California, Los Angeles, United States
5 publications · 99 citations
5
h-index
4
h-index
1–5 of 274
215
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
9 publications
586 citations
University of Pennsylvania
Philadelphia, United States
8 h-index
12 publications
634 citations
University of Southampton
Southampton, United Kingdom
7 h-index
11 publications
629 citations
University of Michigan
Ann Arbor, United States
6 h-index
6 publications
201 citations
University of California, Los Angeles
Los Angeles, United States
5 h-index
8 publications
184 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
5 publications
133 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
4 publications
84 citations

Brandeis University
Waltham, United States
4 h-index
6 publications
415 citations
1–8 of 215
19 publications · 584 citations
14
h-index
13 publications · 1.1K citations
13
h-index
13 publications · 491 citations
13
h-index
Repository · 11 publications · 215 citations
10
h-index
10 publications · 396 citations
10
h-index
1–5