| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420791 | Discrete Applied Mathematics | 2006 | 13 Pages |
Abstract
This paper is devoted to characterize permutations with forbidden patterns by using canonical reduced decompositions, which leads to bijections between Dyck paths and Sn(321)Sn(321) and Sn(231)Sn(231), respectively. We also discuss permutations in SnSn avoiding two patterns, one of length 3 and the other of length k. These permutations produce a kind of discrete continuity between the Motzkin and the Catalan numbers.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Toufik Mansour, Eva Y.P. Deng, Rosena R.X. Du,