Restricted 132-avoiding permutations
Combinatorics
2007-05-23 v2
Abstract
We study generating functions for the number of permutations on n letters avoiding 132 and an arbitrary permutation on k letters, or containing exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.
Cite
@article{arxiv.math/0010047,
title = {Restricted 132-avoiding permutations},
author = {T. Mansour and A. Vainshtein},
journal= {arXiv preprint arXiv:math/0010047},
year = {2007}
}
Comments
10 pages