321-polygon-avoiding permutations and Chebyshev polynomials

Details 321-polygon-avoiding permutations and Chebyshev polynomials 321-polygon-avoiding permutations and Chebyshev polynomials

2002-07-22

arxiv.org/abs/math/0207192v1

Mathematics

Combinatorics

11 pages, 1 figure

Scientific paper

A 321-k-gon-avoiding permutation pi avoids 321 and the following four patterns: k(k+2)(k+3)...(2k-1)1(2k)23...(k+1), k(k+2)(k+3)...(2k-1)(2k)123...(k+1), (k+1)(k+2)(k+3)...(2k-1)1(2k)23...k, (k+1)(k+2)(k+3)...(2k-1)(2k)123...k. The 321-4-gon-avoiding permutations were introduced and studied by Billey and Warrington [BW] as a class of elements of the symmetric group whose Kazhdan-Lusztig, Poincare polynomials, and the singular loci of whose Schubert varieties have fairly simple formulas and descriptions. Stankova and West [SW] gave an exact enumeration in terms of linear recurrences with constant coefficients for the cases k=2,3,4. In this paper, we extend these results by finding an explicit expression for the generating function for the number of 321-k-gon-avoiding permutations on n letters. The generating function is expressed via Chebyshev polynomials of the second kind.

Affiliated with

Also associated with

No associations

Rating

321-polygon-avoiding 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 321-polygon-avoiding permutations and Chebyshev polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 321-polygon-avoiding permutations and Chebyshev polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-673200