Restricted 132-Involutions
Séminaire lotharingien de combinatoire, Tome 48 (2002-2003)
Citer cet article
Voir la notice de l'acte provenant de la source Séminaire Lotharingien de Combinatoire website
We study generating functions for the number of involutions of length n avoiding (or containing exactly once) 132 and avoiding (or containing exactly once) an arbitrary permutation \tau of length k. In several interesting cases these generating functions depend only on k and can be expressed via Chebyshev polynomials of the second kind. In particular, we show that involutions of length n avoiding both 132 and 12...k are equinumerous with involutions of length n avoiding both 132 and any extended double-wedge pattern of length k. We use combinatorial methods to prove several of our results.