Pattern matching in $(213,231)$-avoiding permutations

Both Emerite Neou, Romeo Rizzi, Stéphane Vialette

Given permutations $\sigma \in S_k$ and $\pi \in S_n$ with $k<n$, the \emph{pattern matching} problem is to decide whether $\pi$ matches $\sigma$ as an order-isomorphic subsequence. We give a line…