scientific article; zbMATH DE number 3559589
From MaRDI portal
Publication:4132542
Recommendations
Cited in
(26)- An occurrence of the Robinson-Schensted correspondence
- Ascending subsequences of permutations and the shapes of tableaux
- On Schensted's construction and the multiplication of Schur functions
- Planarity properties of the Schensted correspondence
- A Robinson-Schensted algorithm for a class of partial orders
- The TP\(_{2}\) ordering of Kimeldorf and Sampson has the normal-agreeing property
- Note on the minimal permutations
- Robinson-Schensted correspondence for unit interval orders
- Semistandard tableaux associated with generalized labellings of posets
- Permutations, matrices, and generalized Young tableaux
- Minimal and maximal elements in two-sided cells of \(S_n\) and Robinson-Schensted correspondence
- Schröder partitions and Schröder tableaux
- The Robinson property and amalgamations of higher arities
- 231-avoiding permutations and the Schensted correspondence
- The dominance order for permutations
- scientific article; zbMATH DE number 3884163 (Why is no real title available?)
- Acyclic Digraphs, Young Tableaux and Nilpotent Matrices
- scientific article; zbMATH DE number 1760834 (Why is no real title available?)
- scientific article; zbMATH DE number 218037 (Why is no real title available?)
- Schröder partitions, Schröder tableaux and weak poset patterns
- Monotone subsets in lattices and the Schensted shape of a Sós permutation
- scientific article; zbMATH DE number 7266990 (Why is no real title available?)
- Permutations whose reverse shares the same recording tableau in the RS correspondence
- RS-complete cycle decompositions
- Enumerating \(r\)c-invariant permutations with no long decreasing subsequences
- The number of steps in the Robinson-Schensted algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132542)