Motzkin Numbers Count 2-Stack-Sortable Permutations Ending in Their Least Entry

Abstract

We prove the following conjecture of Zhang (arXiv:2604.10779, Conjecture 6.1): for $n\ge 0$, the number of $2$-stack-sortable permutations of $\{0,1,\dots ,n\}$ ending in $0$ is the $n$th Motzkin number. By Zhang's result, there is a bijection between $2$-stack-sortable permutations ending in their least element and standard composition tableaux of width at most $2$. We then show bijectively that there are an equal number of these and standard Young tableaux of width at most $3$, which are known to be counted by the Motzkin numbers.

arXiv comment11 pages, 1 figure