Finite-state enumeration of adjacency-constrained 132-avoiding permutations

Teruki Mayama, Dai Akita

For a fixed integer $m\ge 1$, let ${\mathcal{A}}_n^{(m)}$ be the set of permutations $\pi \in S_n$ that avoid the pattern $132$ and satisfy the adjacency bound $|{\pi }_{i+1}-{\pi }_i|\le m$ for…