Avoiding patterns in irreducible permutations
Abstrak
We explore the classical pattern avoidance question in the case of irreducible permutations, <i>i.e.</i>, those in which there is no index $i$ such that $\sigma (i+1) - \sigma (i)=1$. The problem is addressed completely in the case of avoiding one or two patterns of length three, and several well known sequences are encountered in the process, such as Catalan, Motzkin, Fibonacci, Tribonacci, Padovan and Binary numbers. Also, we present constructive bijections between the set of Motzkin paths of length $n-1$ and the sets of irreducible permutations of length $n$ (respectively fixed point free irreducible involutions of length $2n$) avoiding a pattern $\alpha$ for $\alpha \in \{132,213,321\}$. This induces two new bijections between the set of Dyck paths and some restricted sets of permutations.
Topik & Kata Kunci
Penulis (1)
Jean-Luc Baril
Akses Cepat
- Tahun Terbit
- 2016
- Sumber Database
- DOAJ
- DOI
- 10.46298/dmtcs.2158
- Akses
- Open Access ✓