Restricted permutations and Chebyshev polynomials
Abstract
We study generating functions for the number of permutations in n subject to two restrictions. One of the restrictions belongs to 3, while the other to k. It turns out that in a large variety of cases the answer can be expressed via Chebyshev polynomials of the second kind.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.