Restricted 132-avoiding permutations

T. Mansour; A. Vainshtein

Restricted 132-avoiding permutations

组合数学 2007-05-23 v2

作者: T. Mansour , A. Vainshtein

摘要

We study generating functions for the number of 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/0010047,
  title  = {Restricted 132-avoiding permutations},
  author = {T. Mansour and A. Vainshtein},
  journal= {arXiv preprint arXiv:math/0010047},
  year   = {2007}
}

备注

10 pages

相关论文

查看更多相关论文 →