An analog of Schensted's algorithm for shifted Young tableaux (Q1137042): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0097-3165(79)90003-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038738479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Schensted's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutations, matrices, and generalized Young tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Increasing and Decreasing Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Application of Plane Partitions: Part 1 / rank
 
Normal rank

Latest revision as of 03:24, 13 June 2024

scientific article
Language Label Description Also known as
English
An analog of Schensted's algorithm for shifted Young tableaux
scientific article

    Statements

    An analog of Schensted's algorithm for shifted Young tableaux (English)
    0 references
    0 references
    1979
    0 references
    Schensted's algorithm
    0 references
    shifted Young tableaux
    0 references
    diagonal elements
    0 references
    equivalence by adjacent transposition
    0 references
    permutations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references