Avoiding patterns in irreducible permutations

Abstract : We explore the classical pattern avoidance question in the case of irreducible permutations, i.e., 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-01352852
Contributor : Coordination Episciences Iam <>
Submitted on : Tuesday, August 16, 2016 - 2:56:42 PM
Last modification on : Wednesday, September 12, 2018 - 1:27:26 AM
Long-term archiving on : Thursday, November 17, 2016 - 10:31:25 AM

File

2343-9853-1-PB.pdf
Explicit agreement for this submission

Identifiers

  • HAL Id : hal-01352852, version 1

Collections

Citation

Jean-Luc Baril. Avoiding patterns in irreducible permutations. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2016, Vol. 17 no. 3 (3), pp.13-30. ⟨hal-01352852⟩

Share

Metrics

Record views

216

Files downloads

585