Generalized Robinson-Schensted-Knuth correspondence

DOI10.1007/BF01247093zbMath0698.05003MaRDI QIDQ912095

Fomin, Sergey

Publication date: 1988

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/188549

zbMATH Keywords

Young diagram; Young graph; finite partially ordered set; graded graphs; integer-valued mapping

Mathematics Subject Classification ID

06A06: Partial orders, general

05A05: Permutations, words, matrices

05C20: Directed graphs (digraphs), tournaments

Related Items

Combinatorics of rooted trees and Hopf algebras, Algebras Associated to the Young-Fibonacci Lattice, Finite posets and Ferrers shapes, Evacuation and a geometric construction for Fibonacci tableaux, Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes, \(k\)-ribbon Fibonacci tableaux, Enumeration of bilaterally symmetric 3-noncrossing partitions, Tableau algorithms defined naturally for pictures, Flag varieties and interpretations of Young tableau algorithms, The Martin boundary of the Young-Fibonacci lattice, Signed differential posets and sign-imbalance, Pieri's formula for generalized Schur polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• An extension of Schensted's theorem
• Some partitions associated with a partially ordered set
• Permutations, matrices, and generalized Young tableaux
• A decomposition theorem for partially ordered sets
• Longest Increasing and Decreasing Subsequences
• The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth Algorithm
• La correspondance de Robinson
• Quelques remarques sur une Construction de Schensted.
• Theory and Application of Plane Partitions: Part 1
• The structure of Sperner k-families