arXiv Analytics

Sign in

arXiv:math/0011127 [math.CO]AbstractReferencesReviewsResources

Restricted permutations and Chebyshev polynomials

T. Mansour, A. Vainshtein

Published 2000-11-17, updated 2002-01-09Version 5

We study generating functions for the number of permutations in $\SS_n$ subject to two restrictions. One of the restrictions belongs to $\SS_3$, while the other to $\SS_k$. It turns out that in a large variety of cases the answer can be expressed via Chebyshev polynomials of the second kind.

Comments: 17 pages, 5 figures
Categories: math.CO
Subjects: 05A05, 05A15, 30B70, 42C05
Related articles: Most relevant | Search more
arXiv:math/0010047 [math.CO] (Published 2000-10-04, updated 2000-11-07)
Restricted 132-avoiding permutations
arXiv:math/0302014 [math.CO] (Published 2003-02-02)
Restricted even permutations and Chebyshev polynomials
arXiv:math/0108043 [math.CO] (Published 2001-08-06)
Restricted set of patterns, continued fractions, and Chebyshev polynomials

Links

Toolbox