Restricted set of patterns, continued fractions, and Chebyshev polynomials
T. Mansour
Abstract
We study generating functions for the number of permutations in Sn subject to set of restrictions. One of the restrictions belongs to S3, while the others to Sk. It turns out that in a large variety of cases the answer can be expressed via continued fractions, and Chebyshev polynomials of the second kind.
Create a lesson
Related papers
Cones of Theta Graphs are Enumeratively Chromatic-Choosable
Kingston Barnes, Vincent Fesenmeier, Braxton Gaither et al.
Polynomial Identities for Generalized Fibonacci Sequences
Joey Glampe, Aryaman Joshi, Swagat Malla et al.
Davenport Constants of Finite Abelian Groups
Dongchun Han, Hanbin Zhang
How iterated sumsets grow under the assumption of small doubling
Dongchun Han, Qinghai Zhong
Sharp lower bounds for bisections of graphs with bounded maximum degree
Qiwen Guo, Gregory Gutin
Hilbert functions over the exterior algebra and f-vectors in higher rank II: Generalizing Linusson's count to sumsets of f-vectors
Jan Snellman