Schensted algorithms for dual graded graphs (Q1344189)

From MaRDI portal
Revision as of 02:48, 19 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Schensted algorithms for dual graded graphs
scientific article

    Statements

    Schensted algorithms for dual graded graphs (English)
    0 references
    0 references
    11 July 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    Young diagram
    0 references
    Robinson-Schensted correspondence
    0 references
    dual graded graphs
    0 references
    posets
    0 references