Abstract
We study bivariate generating functions for the number of involutions in Sn 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 π or contain π exactly once. In many cases we express these generating functions in terms of Chebyshev polynomials of the second kind.
Original language | English |
---|---|
Pages (from-to) | 118-137 |
Number of pages | 20 |
Journal | Advances in Applied Mathematics |
Volume | 36 |
Issue number | 2 |
DOIs | |
State | Published - Feb 2006 |
Keywords
- Chebyshev polynomial
- Forbidden subsequence
- Pattern-avoiding permutation
- Restricted involution
- Restricted permutation
ASJC Scopus subject areas
- Applied Mathematics