Permutation sign under the Robinson-Schensted correspondence (Q1889894): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q600656 |
||
Property / reviewed by | |||
Property / reviewed by: Stephanie Van Willigenburg / rank | |||
Revision as of 05:18, 20 February 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
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