Layered restrictions and Chebyshev polynomials
Abstract
Description
A permutation is called layered if it consists of the disjoint union of substrings (layers) so that the entries decrease within each layer, and increase between the layers. We find the generating function for the number of permutations on $n$ letters avoiding $(1,2,3)$ and a layered permutation on $k$ letters. In the most interesting case of two layers, the generating function depends only on $k$ and is expressed via Chebyshev polynomials of the second kind.
8 pages
8 pages