Abstract.
A permutation is said to be alternating if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alternating permutations on n letters that avoid or contain exactly once 132 and also avoid or contain exactly once an arbitrary pattern on k letters. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
AMS Subject Classification: 05A05, 05A15, 30B70, 42C05.
Rights and permissions
About this article
Cite this article
Mansour, T. Restricted 132-Alternating Permutations and Chebyshev Polynomials. Ann. Combin. 7, 201–227 (2003). https://doi.org/10.1007/s00026-003-0182-2
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00026-003-0182-2