Mathematics – Combinatorics
Scientific paper
2003-02-02
Mathematics
Combinatorics
20 pages
Scientific paper
We study generating functions for the number of even (odd) 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.
No associations
LandOfFree
Restricted even permutations and Chebyshev polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Restricted even permutations and Chebyshev polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Restricted even permutations and Chebyshev polynomials will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-164259