Complementary algorithms for tableaux (Q5952336): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: math/0002244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tableau switching: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3129746 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual equivalence with applications, including a conjecture of Proctor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutations, matrices, and generalized Young tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Robinson-Schensted and Schützenberger algorithms, an elementary approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percentage-avoiding, northwest shapes and peelable tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robinson-Schensted algorithms for skew tableaux / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Increasing and Decreasing Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quelques remarques sur une Construction de Schensted. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3039560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational tableaux and the tensor algebra of \(gl_ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insertion and the multiplication of rational Schur functions / rank
 
Normal rank

Latest revision as of 21:11, 3 June 2024

scientific article; zbMATH DE number 1688741
Language Label Description Also known as
English
Complementary algorithms for tableaux
scientific article; zbMATH DE number 1688741

    Statements

    Complementary algorithms for tableaux (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 July 2003
    0 references
    In 1987, in his theory of rational tableaux, Stembridge found a striking duality between the insertion procedure of Schensted and the theory of jeu de taquin of Schützenberger. In the paper under review the authors introduce the involutive tableau operation of complementation to formalize this duality and show that the internal row insertion and the jeu de taquin give complementary operations on pairs of tableaux. By conjugation, one may consider the operation of internal column insertion. The complementary operation hopscotch, studied by the authors, is new, although it extends known algorithms. Like the other three operations, this new operation may be computed with a set of local rules in a grow diagram. The four operations of jeu de taquin, internal row insertion, internal column insertion and hopscotch preserve the Knuth equivalence. Hence hopscotch gives rise to new algorithms to rectify tableaux. The authors also establish that these four operations have the same dual-equivalence theory.
    0 references
    tableaux
    0 references
    jeu de taquin
    0 references
    insertion algorithm
    0 references
    Knuth equivalence
    0 references

    Identifiers