Restricted 132-Involutions and Chebyshev Polynomials

Details Restricted 132-Involutions and Chebyshev Polynomials Restricted 132-Involutions and Chebyshev Polynomials

2002-01-15

arxiv.org/abs/math/0201136v1

Mathematics

Combinatorics

18 pages, 1 figure

Scientific paper

We study generating functions for the number of involutions in $S_n$ avoiding (or containing once) 132, and avoiding (or containing once) an arbitrary permutation $\tau$ on $k$ letters. In several interesting cases the generating function depends only on $k$ and is expressed via Chebyshev polynomials of the second kind. In particular, we establish that involutions avoiding both 132 and $12... k$ have the same enumerative formula according to the length than involutions avoiding both 132 and any {\em double-wedge pattern} possibly followed by fixed points of total length $k$. Many results are also shown with a combinatorial point of view.

Affiliated with

Also associated with

No associations

Rating

Restricted 132-Involutions 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 132-Involutions and Chebyshev Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Restricted 132-Involutions and Chebyshev Polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-554150