Restricted 132-alternating permutations and Chebyshev polynomials
| dc.creator | Mansour, T. | |
| dc.date | 2002-10-04 | |
| dc.date.accessioned | 2026-07-07T04:51:37Z | |
| dc.date.available | 2026-07-07T04:51:37Z | |
| dc.description | A permutation is said to be \emph{alternating} if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alternating permutations on $n$ letters that avoid or contain exactly once 132 and also avoid or contain exactly once an arbitrary pattern on $k$ letters. In several interesting cases the generating function depends only on $k$ and is expressed via Chebyshev polynomials of the second kind. | |
| dc.description | 22 pages | |
| dc.identifier | https://arxiv.org/abs/math/0210058 | |
| dc.identifier | http://arxiv.org/abs/math/0210058 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65172 | |
| dc.subject | Combinatorics | |
| dc.title | Restricted 132-alternating permutations and Chebyshev polynomials | |
| dc.type | text |