arXiv Analytics

Sign in

arXiv:math/0401217 [math.CO]AbstractReferencesReviewsResources

Involutions Restricted by 3412, Continued Fractions, and Chebyshev Polynomials

Eric Egge, Toufik Mansour

Published 2004-01-18Version 1

We study generating functions for the number of involutions, even involutions, and odd involutions in $S_n$ subject to two restrictions. One restriction is that the involution avoid 3412 or contain 3412 exactly once. The other restriction is that the involution avoid another pattern $\tau$ or contain $\tau$ exactly once. In many cases we express these generating functions in terms of Chebyshev polynomials of the second kind.

Related articles: Most relevant | Search more
arXiv:math/0307050 [math.CO] (Published 2003-07-03)
Restricted 3412-Avoiding Involutions: Continued Fractions, Chebyshev Polynomials and Enumerations
arXiv:math/0108043 [math.CO] (Published 2001-08-06)
Restricted set of patterns, continued fractions, and Chebyshev polynomials
arXiv:math/0208046 [math.CO] (Published 2002-08-06)
Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials