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 2 n) avoiding a pattern alpha for alpha is an element of {132, 213, 321}. This induces two new bijections between the set of Dyck paths and some restricted sets of permutations.
Type de document :
Article dans une revue
Liste complète des métadonnées

Contributeur : Le2i - Université de Bourgogne <>
Soumis le : vendredi 16 décembre 2016 - 18:10:48
Dernière modification le : mercredi 8 janvier 2020 - 11:26:12


  • HAL Id : hal-01418662, version 1


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



Consultations de la notice