Restricted permutations by patterns of type $(2,1)$
| dc.creator | Mansour, T. | |
| dc.date | 2002-02-21 | |
| dc.date.accessioned | 2026-07-07T04:46:36Z | |
| dc.date.available | 2026-07-07T04:46:36Z | |
| dc.description | Recently, Babson and Steingrimsson (see \cite{BS}) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. In this paper we study the generating functions for the number of permutations on $n$ letters avoiding a generalized pattern $ab\mn c$ where $(a,b,c)\in S_3$, and containing a prescribed number of occurrences of generalized pattern $cd\mn e$ where $(c,d,e)\in S_3$. As a consequence, we derive all the previously known results for this kind of problems, as well as many new results. | |
| dc.description | 19 pages | |
| dc.identifier | https://arxiv.org/abs/math/0202219 | |
| dc.identifier | http://arxiv.org/abs/math/0202219 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/63399 | |
| dc.subject | Combinatorics | |
| dc.title | Restricted permutations by patterns of type $(2,1)$ | |
| dc.type | text |