Restricted even permutations and Chebyshev polynomials

We study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation on k letters, or containing exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind. 2000 Mathematics Subject Classification: Primary 05A05, 05A15; Secondary 30B70, 42C05

• Type: Journal
• Year: 2006
• Where: DM
• Authors: Toufik Mansour
• Keywords: Arbitrary Permutation, DM 2006, Permutation, Study Generating