On a conjecture concerning two-stack sortable permutations
The two-stack sortable permutations of length $n$ are known to be equinumerous with permutations of length $n$ avoiding the dashed patterns $3\text{-}1\text{-}4\text{-}2$ and $2\text{-}41\text{-}3$. In this paper, we confirm an intriguing conjecture posed by Claesson, Kitaev, and Steingr\'imsson, which asserts that the...