The Schensted Correspondence and Lexicographic Matchings on Multisubset Lattices

DOI10.1137/0602036zbMATH Open0498.05010OpenAlexW1980142468MaRDI QIDQ3963015FDOQ3963015

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

• Permutations, matrices, and generalized Young tableaux
• Longest Increasing and Decreasing Subsequences
• Strong versions of Sperner's theorem
• Lexicographic matching in Boolean algebras
• Title not available (Why is that?)
• Four correspondences between graphs and generalized Young tableaux
• Tableaux and matrix correspondences
• Recursive matching algorithms and linear orders on the subset lattice

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)