restricted 1-3-2 permutations and generalized patterns
| dc.creator | Mansour, T. | |
| dc.date | 2001-10-03 | |
| dc.date.accessioned | 2026-07-07T04:43:38Z | |
| dc.date.available | 2026-07-07T04:43:38Z | |
| dc.description | Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We study generating functions for the number of permutations on $n$ letters avoiding $1-3-2$ (or containing $1-3-2$ exactly once) and an arbitrary generalized pattern $τ$ on $k$ letters, or containing $τ$ exactly once. In several cases the generating function depends only on $k$ and is expressed via Chebyshev polynomials of the second kind, and generating function of Motzkin numbers. | |
| dc.description | 10 pages | |
| dc.identifier | https://arxiv.org/abs/math/0110039 | |
| dc.identifier | http://arxiv.org/abs/math/0110039 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/62313 | |
| dc.subject | Combinatorics | |
| dc.title | restricted 1-3-2 permutations and generalized patterns | |
| dc.type | text |