arXiv Analytics

Sign in

arXiv:math/0108043 [math.CO]AbstractReferencesReviewsResources

Restricted set of patterns, continued fractions, and Chebyshev polynomials

T. Mansour

Published 2001-08-06Version 1

We study generating functions for the number of permutations in $S_n$ subject to set of restrictions. One of the restrictions belongs to $S_3$, while the others to $S_k$. It turns out that in a large variety of cases the answer can be expressed via continued fractions, and Chebyshev polynomials of the second kind.

Comments: 9 pages
Categories: math.CO
Subjects: 05A05, 05A15, 30B70, 42C05
Related articles: Most relevant | Search more
arXiv:math/0401217 [math.CO] (Published 2004-01-18)
Involutions Restricted by 3412, Continued Fractions, and Chebyshev Polynomials
arXiv:math/0302014 [math.CO] (Published 2003-02-02)
Restricted even permutations and Chebyshev polynomials
arXiv:math/0010047 [math.CO] (Published 2000-10-04, updated 2000-11-07)
Restricted 132-avoiding permutations

Links

Toolbox