A Robinson-Schensted algorithm for a class of partial orders

DOI10.1006/jcta.1997.2769zbMath0882.05113OpenAlexW2079700103MaRDI QIDQ1369676

David G. Wagner, Thomas S. Sundquist, Julian West

Publication date: 2 March 1998

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1997.2769

zbMATH Keywords

Schur functionsfinite posetchromatic symmetric functionincomparability graphRobinson-Schensted algorithm

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Combinatorics of partially ordered sets (06A07) Enumerative combinatorics (05A99) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Descents, quasi-symmetric functions, Robinson-Schensted for posets, and the chromatic symmetric function ⋮ Lollipop and Lariat Symmetric Functions ⋮ Robinson-Schensted correspondence for unit interval orders ⋮ Counting domino tilings of rectangles via resultants ⋮ Chromatic posets

Cites Work

• Unnamed Item
• Duality of graded graphs
• Schensted algorithms for dual graded graphs
• Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
• On immanants of Jacobi-Trudi matrices and permutations with restricted position
• A symmetric function generalization of the chromatic polynomial of a graph
• Recognizing bull-free perfect graphs
• Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive
• Longest Increasing and Decreasing Subsequences

This page was built for publication: A Robinson-Schensted algorithm for a class of partial orders