Restricted permutations and Chebyshev polynomials
From MaRDI portal
Abstract: We study generating functions for the number of permutations in subject to two restrictions. One of the restrictions belongs to , while the other to . It turns out that in a large variety of cases the answer can be expressed via Chebyshev polynomials of the second kind.
Recommendations
Cited in
(30)- Forbidden subsequences and Chebyshev polynomials
- On the diagram of 132-avoiding permutations
- Restricted 132-alternating permutations and Chebyshev polynomials
- Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three
- Layered restrictions and Chebyshev polynomials
- Restricted permutations, continued fractions, and Chebyshev polynomials
- Hopping from Chebyshev polynomials to permutation statistics
- The generalized lucky ticket problem, perfect matchings, and closure relations satisfied by the Chebyshev and \(q\)-Hermite polynomials
- Kernel method and linear recurrence system
- Bivariate generating functions for involutions restricted by 3412
- Restricted 132-avoiding \(k\)-ary words, Chebyshev polynomials, and continued fractions
- Horse paths, restricted 132-avoiding permutations, continued fractions, and Chebyshev polynomials
- Restricted even permutations and Chebyshev polynomials
- Dyck paths and restricted permutations
- Simple permutations and pattern restricted permutations
- Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials
- Locally convex words and permutations
- scientific article; zbMATH DE number 2127715 (Why is no real title available?)
- New equivalences for pattern avoiding involutions
- Enumeration formulæ for pattern restricted Stirling permutations
- Semi-perimeter and inner site-perimeter of k-ary words and bargraphs
- Counting water cells in bargraphs of compositions and set partitions
- scientific article; zbMATH DE number 7106992 (Why is no real title available?)
- Patterns in random permutations avoiding the pattern 132
- Staircase words and Chebyshev polynomials
- Smooth partitions and Chebyshev polynomials
- Restricted 3412-avoiding involutions, continued fractions, and Chebyshev polynomials
- Restricted Dumont permutations, Dyck paths, and noncrossing partitions
- Restricted colored permutations and Chebyshev polynomials
- A general theory of Wilf-equivalence for Catalan structures
This page was built for publication: Restricted permutations and Chebyshev polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1865534)