Restricted even permutations and Chebyshev polynomials

Toufik Mansour

Restricted even permutations and Chebyshev polynomials

Combinatorics 2007-05-23 v1

Authors: Toufik Mansour

Abstract

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.

Keywords

pattern avoidance in permutations permutations

Cite

@article{arxiv.math/0302014,
  title  = {Restricted even permutations and Chebyshev polynomials},
  author = {Toufik Mansour},
  journal= {arXiv preprint arXiv:math/0302014},
  year   = {2007}
}

Comments

20 pages

Related papers

View all related →