Permutation sign under the Robinson-Schensted correspondence (Q1889894): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Importer (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034887759 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0309266 / rank
 
Normal rank

Latest revision as of 22:40, 18 April 2024

scientific article
Language Label Description Also known as
English
Permutation sign under the Robinson-Schensted correspondence
scientific article

    Statements

    Permutation sign under the Robinson-Schensted correspondence (English)
    0 references
    0 references
    13 December 2004
    0 references
    This charming and concise paper adds to the wealth of connections between permutation statistics and the combinatorics of Young tableaux by generalising, to all permutations, a result of the author's that obtains the sign of a 321-avoiding permutation from the Robinson-Schensted correspondence. More precisely, after briefly surveying the classic literature, she proves the key lemma that an elementary Knuth transformation applied to a permutation causes a sign reversal in the recording tableau obtained from the Robinson-Schensted correspondence. From here, the author derives the main result that the sign of a permutation can be calculated from the pair of tableaux it corresponds to via the Robinson-Schensted correspondence. Finally, she uses this to prove a special case of Stanley's sign-imbalance conjecture, and to prove that there are as many odd as even permutations that are both 213- and 231-avoiding.
    0 references
    sign
    0 references
    permutation
    0 references
    tableaux
    0 references
    Robinson-Schensted correspondence
    0 references
    Knuth equivalence
    0 references
    Beissinger algorithm
    0 references
    sign-imbalance
    0 references

    Identifiers