Restricted 132-avoiding permutations
classification
🧮 math.CO
keywords
avoidinggeneratingletterspermutationsarbitrarycaseschebyshevcontaining
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.