The Schensted Correspondence and Lexicographic Matchings on Multisubset Lattices

DOI10.1137/0602036zbMath0498.05010OpenAlexW1980142468MaRDI QIDQ3963015

Kiem-Phong Vo

Publication date: 1981

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0602036

zbMATH Keywords

tableauxmultisetchain decompositionslexicographic matchingsbiwords

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Chain conditions, complete algebras (06E10)

Related Items

Recursive Algorithms for Unitary and Symplectic Group Representations

Cites Work

• Unnamed Item
• Tableaux and matrix correspondences
• Strong versions of Sperner's theorem
• Recursive matching algorithms and linear orders on the subset lattice
• Four correspondences between graphs and generalized Young tableaux
• Lexicographic matching in Boolean algebras
• Permutations, matrices, and generalized Young tableaux
• Longest Increasing and Decreasing Subsequences