2000 character limit reached
Permutations whose reverse shares the same recording tableau in the RSK correspondence (2108.08657v1)
Published 19 Aug 2021 in math.CO
Abstract: The RSK correspondence is a bijection between permutations and pairs of standard Young tableaux with identical shape, where the tableaux are commonly denoted $P$ (insertion) and $Q$ (recording). It has been an open problem to demonstrate $$ |{w \in \mathfrak{S}_n | \, Q(w) = Q(wr)}| = \begin{cases} \displaystyle 2{\frac{n-1}{2}}{n-1 \choose \frac{n-1}{2}} & n \text{ odd} \newline \displaystyle 0 & n \text{ even} \end{cases}, $$ where $wr$ is the reverse permutation of $w$. First we show that for each $w$ where $Q(w) = Q(wr)$ the recording tableau $Q(w)$ has a symmetric hook shape and satisfies a certain simple property. From these two results, we succeed in proving the desired identity.