Lehmer Codes and the Reverse-Complement Mapping from (32-1)-Avoiding Permutations to (3-21)-Avoiding Permutations

Andrew Beveridge, Yufan Hu, Yucheng Liu

Let $S_n(32\text{-}1)$ and $S_n(3\text{-}21)$ denote the sets of $n$-permutations avoiding the vincular patterns $32\text{-}1$ and $3\text{-}21$, respectively. Using Lehmer codes,…