Restricted set of patterns, continued fractions, and Chebyshev polynomials
组合数学
2007-05-23 v1
摘要
We study generating functions for the number of permutations in subject to set of restrictions. One of the restrictions belongs to , while the others to . It turns out that in a large variety of cases the answer can be expressed via continued fractions, and Chebyshev polynomials of the second kind.
引用
@article{arxiv.math/0108043,
title = {Restricted set of patterns, continued fractions, and Chebyshev polynomials},
author = {T. Mansour},
journal= {arXiv preprint arXiv:math/0108043},
year = {2007}
}
备注
9 pages