Restricted 132-Avoiding Permutations

Authors: Mansour T.¹; Vainshtein A.²

Source: Advances in Applied Mathematics, Volume 26, Number 3, April 2001 , pp. 258-269(12)

Buy & download fulltext article:

Price: $52.63 plus tax (Refund Policy)

Abstract:

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. Copyright 2001 Academic Press.

Language: English

Document Type: Research article

Affiliations: 1: Department of Mathematics, University of Haifa, Haifa, 31905, Israel 2: Departments of Mathematics and Computer Science, University of Haifa, Haifa, 31905, Israel

Publication date: 2001-04-01