The Schensted Correspondence and Lexicographic Matchings on Multisubset Lattices

DOI10.1137/0602036MaRDI QIDQ3963015zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3065933 (Why is no real title available?)
• Four correspondences between graphs and generalized Young tableaux
• Lexicographic matching in Boolean algebras
• Longest Increasing and Decreasing Subsequences
• Permutations, matrices, and generalized Young tableaux
• Recursive matching algorithms and linear orders on the subset lattice
• Strong versions of Sperner's theorem
• Tableaux and matrix correspondences

Cited in

(1)

• Recursive Algorithms for Unitary and Symplectic Group Representations

This page was built for publication: The Schensted Correspondence and Lexicographic Matchings on Multisubset Lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3963015)