A bijection between $321$- and $213$-avoiding permutations preserving $t$-stack-sortability

Abstract

We construct a bijection between $321$- and $213$-avoiding permutations that preserves the property of $t$-stack-sortability. Our bijection transforms natural statistics between these two classes of permutations and proves a refinement of an enumerative conjecture posed by Zhang and Kitaev. This work contributes further to the long-standing line of research on bijections between length-3 pattern avoiding permutations. Increasing binary trees lie at the heart of our approach.

16 pages, 7 figures