2,913 research outputs found

    Restricted 132-avoiding permutations

    Get PDF
    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.Comment: 10 page