Schensted algorithms for dual graded graphs (Q1344189)

From MaRDI portal
Revision as of 21:23, 27 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q105615900, #quickstatements; #temporary_batch_1711565664090)
scientific article
Language Label Description Also known as
English
Schensted algorithms for dual graded graphs
scientific article

    Statements

    title
    Schensted algorithms for dual graded graphs (English)
    0 references
    publication date
    11 July 1995
    0 references
    Mathematics Subject Classification ID
    05E10
    0 references
    05A15
    0 references
    06A07
    0 references
    zbMATH DE Number
    720762
    0 references
    zbMATH Keywords
    Young diagram
    0 references
    Robinson-Schensted correspondence
    0 references
    dual graded graphs
    0 references
    posets
    0 references
    author
    Fomin, Sergey
    0 references
    Wikidata QID
    Q105615900
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1344189&oldid=33211898"
    Powered by MediaWiki