Restricted even permutations and Chebyshev polynomials

Toufik Mansour

Restricted even permutations and Chebyshev polynomials

组合数学 2007-05-23 v1

作者: Toufik Mansour

摘要

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.

关键词

pattern avoidance in permutations permutations

引用

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

备注

20 pages

相关论文

查看更多相关论文 →