Stack words, standard tableaux and Baxter permutations (Q1924361)

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.