Stack words, standard tableaux and Baxter permutations (Q1924361)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Stack words, standard tableaux and Baxter permutations |
scientific article |
Statements
Stack words, standard tableaux and Baxter permutations (English)
0 references
14 October 1996
0 references
The authors present some results connected with the enumeration of stack sortable permutations. In particular, they show that the number of \(3\times n\) rectangular standard Young tableaux which avoid two consecutive integers on the second row is \(c_n^2\) where \(c_n=(2n)!/ (n+1)!n!\) and establish a 1-1 correspondence between the same tableaux which avoid two consecutive integers on the same row and Baxter permutations.
0 references
enumeration
0 references
stack sortable permutations
0 references
Young tableaux
0 references
Baxter permutations
0 references