arXiv Analytics

Sign in

arXiv:math/0010047 [math.CO]AbstractReferencesReviewsResources

Restricted 132-avoiding permutations

T. Mansour, A. Vainshtein

Published 2000-10-04, updated 2000-11-07Version 2

We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation $\tau$ on k letters, or containing $\tau$ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.

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

Links

Toolbox